Submission #1304513
Source Code Expand
#include <iostream> #include <utility> #include <algorithm> #include <cstdio> using namespace std; typedef pair<int,int> p; p ans_fun(p p1, p p2, int flag){ p ans; if(p2.first <= p1.second){ if(p2.second > p1.second){ ans.first = p1.first; ans.second = p2.second; return ans; } else return p1; } else if(flag==1) return p1; else return p2; } int main(){ long long n; int d, k; cin >> n >> d >> k; int ans[100]; int bol[100]; for(int i=0;i<100;i++){ ans[i]=bol[i]=-1; } p p_ans[100]; p lr[10000]; for(int i=0; i<d; i++){ int l,r; cin >> l >> r; lr[i].first = l; lr[i].second = r; } int s[100], t[100]; for(int i=0; i<k; i++){ cin >> s[i] >> t[i]; p_ans[i].first = p_ans[i].second = s[i]; //printf("p_ans[%d] = %d %d\n", i, p_ans[i].first, p_ans[i].second); } for(int i=0; i<d; i++){ for(int j=0; j<k; j++){ if(bol[j]){ if(lr[i].first<=p_ans[j].first) p_ans[j]=ans_fun(lr[i],p_ans[j],2); else p_ans[j]=ans_fun(p_ans[j],lr[i],1); //printf("p_ans[%d] = %d %d\n", j, p_ans[j].first, p_ans[j].second); if(p_ans[j].first <= t[j] && t[j] <= p_ans[j].second){ ans[j]=i+1; bol[j]=0; } } } } for(int i=0; i<k; i++) cout << ans[i] << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 民族大移動 |
User | tuananh24 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1337 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask1_43.txt, subtask1_44.txt, subtask1_45.txt, subtask1_46.txt, subtask1_47.txt, subtask1_48.txt, subtask1_49.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 8 ms | 384 KB |
subtask1_02.txt | AC | 4 ms | 384 KB |
subtask1_03.txt | AC | 6 ms | 384 KB |
subtask1_04.txt | AC | 10 ms | 256 KB |
subtask1_05.txt | AC | 11 ms | 384 KB |
subtask1_06.txt | AC | 11 ms | 384 KB |
subtask1_07.txt | AC | 10 ms | 384 KB |
subtask1_08.txt | AC | 6 ms | 384 KB |
subtask1_09.txt | AC | 9 ms | 384 KB |
subtask1_10.txt | AC | 3 ms | 384 KB |
subtask1_11.txt | AC | 10 ms | 384 KB |
subtask1_12.txt | AC | 5 ms | 384 KB |
subtask1_13.txt | AC | 2 ms | 384 KB |
subtask1_14.txt | AC | 10 ms | 384 KB |
subtask1_15.txt | AC | 13 ms | 384 KB |
subtask1_16.txt | AC | 13 ms | 384 KB |
subtask1_17.txt | AC | 13 ms | 384 KB |
subtask1_18.txt | AC | 13 ms | 384 KB |
subtask1_19.txt | AC | 13 ms | 384 KB |
subtask1_20.txt | AC | 13 ms | 384 KB |
subtask1_21.txt | AC | 13 ms | 384 KB |
subtask1_22.txt | AC | 13 ms | 384 KB |
subtask1_23.txt | AC | 13 ms | 256 KB |
subtask1_24.txt | AC | 13 ms | 384 KB |
subtask1_25.txt | AC | 12 ms | 256 KB |
subtask1_26.txt | AC | 13 ms | 256 KB |
subtask1_27.txt | AC | 13 ms | 384 KB |
subtask1_28.txt | AC | 13 ms | 384 KB |
subtask1_29.txt | AC | 13 ms | 384 KB |
subtask1_30.txt | AC | 13 ms | 384 KB |
subtask1_31.txt | AC | 13 ms | 384 KB |
subtask1_32.txt | AC | 12 ms | 384 KB |
subtask1_33.txt | AC | 13 ms | 384 KB |
subtask1_34.txt | AC | 13 ms | 384 KB |
subtask1_35.txt | AC | 13 ms | 384 KB |
subtask1_36.txt | AC | 13 ms | 256 KB |
subtask1_37.txt | AC | 12 ms | 256 KB |
subtask1_38.txt | AC | 13 ms | 384 KB |
subtask1_39.txt | AC | 13 ms | 384 KB |
subtask1_40.txt | AC | 13 ms | 256 KB |
subtask1_41.txt | AC | 16 ms | 384 KB |
subtask1_42.txt | AC | 17 ms | 384 KB |
subtask1_43.txt | AC | 16 ms | 384 KB |
subtask1_44.txt | AC | 17 ms | 384 KB |
subtask1_45.txt | AC | 17 ms | 256 KB |
subtask1_46.txt | AC | 25 ms | 256 KB |
subtask1_47.txt | AC | 17 ms | 384 KB |
subtask1_48.txt | AC | 17 ms | 384 KB |
subtask1_49.txt | AC | 15 ms | 384 KB |