Submission #536663
Source Code Expand
#include <iostream> #include <cstdio> #include <string> #include <algorithm> #include <vector> using namespace std; int main(){ cin.tie(0); ios::sync_with_stdio(false); int i,ans=0,a[110000],b[110000],fa,fb,atb,bta,na=0,nb=0; long long int t=0; bool end=false; cin >> fa >> fb; cin >> atb >> bta; for(i=0;i<fa;i++){ cin >> a[i]; } for(i=0;i<fb;i++){ cin >> b[i]; } while(1){ while(a[na]<t){ na++; if(na==fa){ end=true; break; } } if(end==true) break; t=a[na]+atb; while(b[nb]<t){ nb++; if(nb==fb){ end=true; break; } } if(end==true)break; t=b[nb]+bta; ans++; } cout << ans<< endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | Hoi_koro |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 697 Byte |
Status | AC |
Exec Time | 57 ms |
Memory | 1604 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 50 ms | 1568 KB |
subtask0_1.txt | AC | 40 ms | 1312 KB |
subtask0_10.txt | AC | 43 ms | 1308 KB |
subtask0_11.txt | AC | 45 ms | 1436 KB |
subtask0_12.txt | AC | 48 ms | 1444 KB |
subtask0_13.txt | AC | 43 ms | 1320 KB |
subtask0_14.txt | AC | 53 ms | 1604 KB |
subtask0_2.txt | AC | 46 ms | 1436 KB |
subtask0_3.txt | AC | 48 ms | 1444 KB |
subtask0_4.txt | AC | 46 ms | 1444 KB |
subtask0_5.txt | AC | 42 ms | 1320 KB |
subtask0_6.txt | AC | 53 ms | 1576 KB |
subtask0_7.txt | AC | 49 ms | 1440 KB |
subtask0_8.txt | AC | 42 ms | 1312 KB |
subtask0_9.txt | AC | 52 ms | 1576 KB |
subtask0_sample_01.txt | AC | 29 ms | 920 KB |
subtask0_sample_02.txt | AC | 27 ms | 832 KB |
subtask0_sample_03.txt | AC | 30 ms | 804 KB |
subtask1_0.txt | AC | 57 ms | 1568 KB |
subtask1_1.txt | AC | 56 ms | 1444 KB |
subtask1_10.txt | AC | 49 ms | 1308 KB |
subtask1_11.txt | AC | 57 ms | 1444 KB |
subtask1_12.txt | AC | 57 ms | 1576 KB |
subtask1_13.txt | AC | 56 ms | 1572 KB |
subtask1_14.txt | AC | 49 ms | 1316 KB |
subtask1_2.txt | AC | 56 ms | 1440 KB |
subtask1_3.txt | AC | 52 ms | 1440 KB |
subtask1_4.txt | AC | 55 ms | 1440 KB |
subtask1_5.txt | AC | 55 ms | 1444 KB |
subtask1_6.txt | AC | 54 ms | 1448 KB |
subtask1_7.txt | AC | 53 ms | 1452 KB |
subtask1_8.txt | AC | 51 ms | 1432 KB |
subtask1_9.txt | AC | 57 ms | 1572 KB |