Submission #1686654
Source Code Expand
#include<iostream> #include<algorithm> #include<queue> using namespace std; typedef long long ll; int main() { ll n, m, x, y; cin >> n >> m >> x >> y; queue<ll> a, b; for (int i = 0; i < n; i++) { ll k; cin >> k; a.push(k); } for (int i = 0; i < m; i++) { ll k; cin >> k; b.push(k); } ll now = 0; int cnt = 0; while (true) { while (a.size() && a.front() < now)a.pop(); if (a.size() == 0)goto heaven; now = a.front() + x; a.pop(); while (b.size() && b.front() < now)b.pop(); if (b.size() == 0)goto heaven; now = b.front() + y; b.pop(); cnt++; } heaven:cout << cnt << endl; char c; cin >> c; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | th90tk297 |
Language | C++14 (Clang 3.8.0) |
Score | 100 |
Code Size | 653 Byte |
Status | AC |
Exec Time | 191 ms |
Memory | 1792 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 | 145 ms | 1792 KB |
subtask0_1.txt | AC | 87 ms | 1152 KB |
subtask0_10.txt | AC | 102 ms | 1280 KB |
subtask0_11.txt | AC | 114 ms | 1408 KB |
subtask0_12.txt | AC | 124 ms | 1536 KB |
subtask0_13.txt | AC | 99 ms | 1280 KB |
subtask0_14.txt | AC | 125 ms | 1536 KB |
subtask0_2.txt | AC | 110 ms | 1408 KB |
subtask0_3.txt | AC | 114 ms | 1408 KB |
subtask0_4.txt | AC | 107 ms | 1408 KB |
subtask0_5.txt | AC | 84 ms | 1152 KB |
subtask0_6.txt | AC | 142 ms | 1664 KB |
subtask0_7.txt | AC | 116 ms | 1408 KB |
subtask0_8.txt | AC | 84 ms | 1152 KB |
subtask0_9.txt | AC | 147 ms | 1792 KB |
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 190 ms | 1664 KB |
subtask1_1.txt | AC | 175 ms | 1536 KB |
subtask1_10.txt | AC | 118 ms | 1152 KB |
subtask1_11.txt | AC | 169 ms | 1536 KB |
subtask1_12.txt | AC | 184 ms | 1664 KB |
subtask1_13.txt | AC | 191 ms | 1664 KB |
subtask1_14.txt | AC | 147 ms | 1408 KB |
subtask1_2.txt | AC | 182 ms | 1664 KB |
subtask1_3.txt | AC | 153 ms | 1408 KB |
subtask1_4.txt | AC | 173 ms | 1536 KB |
subtask1_5.txt | AC | 176 ms | 1536 KB |
subtask1_6.txt | AC | 168 ms | 1536 KB |
subtask1_7.txt | AC | 164 ms | 1408 KB |
subtask1_8.txt | AC | 170 ms | 1536 KB |
subtask1_9.txt | AC | 188 ms | 1664 KB |