Submission #536657
Source Code Expand
#include <iostream> #include <vector> using namespace std; int main() { long long n, m, x, y; cin >> n >> m >> x >> y; vector<int> a(n); vector<int> b(m); for(int i = 0; i < n; i++){ cin >> a[i]; } for(int i = 0; i < m; i++){ cin >> b[i]; } long long now = 0; int roundtrip = 0; int i = 0, j = 0; while(1) { for(; i < n; i++){ if(now <= a[i]){ now = a[i] + x; break; } } if(i == n) break; for(; j < m; j++){ if(now <= b[j]){ now = b[j] + y; break; } } if(j == m) break; roundtrip++; } cout << roundtrip << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | c2de6320 |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 828 Byte |
Status | AC |
Exec Time | 151 ms |
Memory | 1572 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 | 121 ms | 1560 KB |
subtask0_1.txt | AC | 82 ms | 1180 KB |
subtask0_10.txt | AC | 93 ms | 1316 KB |
subtask0_11.txt | AC | 100 ms | 1440 KB |
subtask0_12.txt | AC | 111 ms | 1440 KB |
subtask0_13.txt | AC | 91 ms | 1428 KB |
subtask0_14.txt | AC | 108 ms | 1312 KB |
subtask0_2.txt | AC | 99 ms | 1316 KB |
subtask0_3.txt | AC | 100 ms | 1436 KB |
subtask0_4.txt | AC | 97 ms | 1316 KB |
subtask0_5.txt | AC | 80 ms | 1184 KB |
subtask0_6.txt | AC | 119 ms | 1444 KB |
subtask0_7.txt | AC | 101 ms | 1316 KB |
subtask0_8.txt | AC | 80 ms | 1308 KB |
subtask0_9.txt | AC | 124 ms | 1436 KB |
subtask0_sample_01.txt | AC | 26 ms | 804 KB |
subtask0_sample_02.txt | AC | 25 ms | 920 KB |
subtask0_sample_03.txt | AC | 25 ms | 800 KB |
subtask1_0.txt | AC | 150 ms | 1572 KB |
subtask1_1.txt | AC | 141 ms | 1316 KB |
subtask1_10.txt | AC | 105 ms | 1308 KB |
subtask1_11.txt | AC | 138 ms | 1320 KB |
subtask1_12.txt | AC | 147 ms | 1436 KB |
subtask1_13.txt | AC | 151 ms | 1444 KB |
subtask1_14.txt | AC | 123 ms | 1312 KB |
subtask1_2.txt | AC | 150 ms | 1428 KB |
subtask1_3.txt | AC | 127 ms | 1320 KB |
subtask1_4.txt | AC | 140 ms | 1320 KB |
subtask1_5.txt | AC | 140 ms | 1320 KB |
subtask1_6.txt | AC | 137 ms | 1432 KB |
subtask1_7.txt | AC | 133 ms | 1312 KB |
subtask1_8.txt | AC | 139 ms | 1320 KB |
subtask1_9.txt | AC | 151 ms | 1452 KB |