Submission #1355947
Source Code Expand
#include <iostream> #include <vector> using namespace std; int main() { cin.tie(0); ios::sync_with_stdio(false); int N, M; cin >> N >> M; long long X, Y; cin >> X >> Y; vector<long long> As(N); vector<long long> Bs(M); for (auto &a : As) cin >> a; for (auto &b : Bs) cin >> b; int i = 0; int j = 0; long long t = 0; int c = 0; while (true){ t = As[i] + X; while (j < M and Bs[j] < t) ++j; if (j == M) break; t = Bs[j] + Y; ++c; while (i < N and As[i] < t) ++i; if (i == N) break; } cout << c << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | rpy3cpp |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 671 Byte |
Status | AC |
Exec Time | 19 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 | 16 ms | 1792 KB |
subtask0_1.txt | AC | 10 ms | 1152 KB |
subtask0_10.txt | AC | 11 ms | 1280 KB |
subtask0_11.txt | AC | 13 ms | 1408 KB |
subtask0_12.txt | AC | 14 ms | 1536 KB |
subtask0_13.txt | AC | 11 ms | 1280 KB |
subtask0_14.txt | AC | 13 ms | 1536 KB |
subtask0_2.txt | AC | 12 ms | 1408 KB |
subtask0_3.txt | AC | 13 ms | 1408 KB |
subtask0_4.txt | AC | 12 ms | 1408 KB |
subtask0_5.txt | AC | 9 ms | 1152 KB |
subtask0_6.txt | AC | 16 ms | 1664 KB |
subtask0_7.txt | AC | 13 ms | 1408 KB |
subtask0_8.txt | AC | 10 ms | 1152 KB |
subtask0_9.txt | AC | 16 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 | 19 ms | 1664 KB |
subtask1_1.txt | AC | 17 ms | 1536 KB |
subtask1_10.txt | AC | 12 ms | 1152 KB |
subtask1_11.txt | AC | 16 ms | 1536 KB |
subtask1_12.txt | AC | 18 ms | 1792 KB |
subtask1_13.txt | AC | 19 ms | 1664 KB |
subtask1_14.txt | AC | 15 ms | 1280 KB |
subtask1_2.txt | AC | 17 ms | 1536 KB |
subtask1_3.txt | AC | 15 ms | 1408 KB |
subtask1_4.txt | AC | 17 ms | 1536 KB |
subtask1_5.txt | AC | 17 ms | 1536 KB |
subtask1_6.txt | AC | 17 ms | 1536 KB |
subtask1_7.txt | AC | 16 ms | 1408 KB |
subtask1_8.txt | AC | 16 ms | 1536 KB |
subtask1_9.txt | AC | 19 ms | 1664 KB |