Submission #704089
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m, x, y; while (cin>>n>>m>>x>>y) { vector<int> a(n); for(int& e: a) cin>>e; vector<int> b(m); for(int& e: b) cin>>e; int res=0; long long t=a[0]; while (true) { auto i=lower_bound(begin(b), end(b), t+x); if (i==end(b)) break; auto j=lower_bound(begin(a), end(a), *i+y); ++res; if (j==end(a)) break; t=*j; } cout<<res<<endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | hogeover30 |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 623 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 1568 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 | 51 ms | 1568 KB |
subtask0_1.txt | AC | 41 ms | 1320 KB |
subtask0_10.txt | AC | 45 ms | 1320 KB |
subtask0_11.txt | AC | 45 ms | 1448 KB |
subtask0_12.txt | AC | 49 ms | 1444 KB |
subtask0_13.txt | AC | 43 ms | 1320 KB |
subtask0_14.txt | AC | 47 ms | 1440 KB |
subtask0_2.txt | AC | 46 ms | 1316 KB |
subtask0_3.txt | AC | 47 ms | 1320 KB |
subtask0_4.txt | AC | 44 ms | 1308 KB |
subtask0_5.txt | AC | 40 ms | 1180 KB |
subtask0_6.txt | AC | 52 ms | 1568 KB |
subtask0_7.txt | AC | 46 ms | 1440 KB |
subtask0_8.txt | AC | 41 ms | 1192 KB |
subtask0_9.txt | AC | 52 ms | 1568 KB |
subtask0_sample_01.txt | AC | 26 ms | 864 KB |
subtask0_sample_02.txt | AC | 25 ms | 864 KB |
subtask0_sample_03.txt | AC | 26 ms | 928 KB |
subtask1_0.txt | AC | 63 ms | 1448 KB |
subtask1_1.txt | AC | 58 ms | 1448 KB |
subtask1_10.txt | AC | 49 ms | 1188 KB |
subtask1_11.txt | AC | 51 ms | 1444 KB |
subtask1_12.txt | AC | 62 ms | 1444 KB |
subtask1_13.txt | AC | 59 ms | 1456 KB |
subtask1_14.txt | AC | 49 ms | 1308 KB |
subtask1_2.txt | AC | 54 ms | 1448 KB |
subtask1_3.txt | AC | 76 ms | 1316 KB |
subtask1_4.txt | AC | 57 ms | 1444 KB |
subtask1_5.txt | AC | 53 ms | 1444 KB |
subtask1_6.txt | AC | 58 ms | 1452 KB |
subtask1_7.txt | AC | 57 ms | 1448 KB |
subtask1_8.txt | AC | 52 ms | 1448 KB |
subtask1_9.txt | AC | 62 ms | 1448 KB |