Submission #536654
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int n, m, x, y, now = 0, now2, ans=0, save=0; int p[100000], p2[100000]; int main(){ cin >> n >> m >> x >> y; for (int i = 0; i < n; i++) cin >> p[i]; for (int i = 0; i < m; i++) cin >> p2[i]; for (int i = 0; i < n; i++){ if (p[i]>=now&&now2 == 0){ now = p[i] + x; now2 = 1; } for (int j = save; j<m; j++){ if (p2[j]>=now&&now2 == 1){ now = p2[j] + y; now2 = 0; ans++; save = j + 1; break; } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | kazu123 |
Language | C++ (GCC 4.9.2) |
Score | 0 |
Code Size | 569 Byte |
Status | TLE |
Exec Time | 2046 ms |
Memory | 1620 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | TLE | 2034 ms | 1568 KB |
subtask0_1.txt | TLE | 2032 ms | 1320 KB |
subtask0_10.txt | TLE | 2034 ms | 1444 KB |
subtask0_11.txt | TLE | 2036 ms | 1436 KB |
subtask0_12.txt | TLE | 2044 ms | 1552 KB |
subtask0_13.txt | TLE | 2034 ms | 1440 KB |
subtask0_14.txt | TLE | 2033 ms | 1568 KB |
subtask0_2.txt | TLE | 2034 ms | 1444 KB |
subtask0_3.txt | TLE | 2033 ms | 1436 KB |
subtask0_4.txt | TLE | 2034 ms | 1440 KB |
subtask0_5.txt | TLE | 2033 ms | 1312 KB |
subtask0_6.txt | TLE | 2033 ms | 1620 KB |
subtask0_7.txt | TLE | 2037 ms | 1448 KB |
subtask0_8.txt | TLE | 2033 ms | 1244 KB |
subtask0_9.txt | TLE | 2046 ms | 1580 KB |
subtask0_sample_01.txt | AC | 26 ms | 800 KB |
subtask0_sample_02.txt | AC | 25 ms | 928 KB |
subtask0_sample_03.txt | AC | 26 ms | 800 KB |
subtask1_0.txt | TLE | 2034 ms | 1576 KB |
subtask1_1.txt | TLE | 2034 ms | 1448 KB |
subtask1_10.txt | AC | 1755 ms | 1188 KB |
subtask1_11.txt | TLE | 2033 ms | 1456 KB |
subtask1_12.txt | TLE | 2034 ms | 1568 KB |
subtask1_13.txt | TLE | 2035 ms | 1560 KB |
subtask1_14.txt | TLE | 2034 ms | 1440 KB |
subtask1_2.txt | TLE | 2034 ms | 1564 KB |
subtask1_3.txt | TLE | 2033 ms | 1360 KB |
subtask1_4.txt | TLE | 2032 ms | 1444 KB |
subtask1_5.txt | TLE | 2032 ms | 1564 KB |
subtask1_6.txt | TLE | 2033 ms | 1440 KB |
subtask1_7.txt | TLE | 2032 ms | 1440 KB |
subtask1_8.txt | TLE | 2031 ms | 1436 KB |
subtask1_9.txt | TLE | 2035 ms | 1556 KB |