Submission #1304507
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<(n);i++) int n, m, x, y; int a[100010], b[100010]; int main(void){ cin >> n >> m >> x >> y; rep(i, n) cin >> a[i]; rep(i, m) cin >> b[i]; int i = 0, j = 0, now = 0; int cnt = 0; while(1){ if(cnt % 2 == 0){//a空港 while(i < n && a[i] < now) i++; if(i == n) break; cnt++; now = a[i] + x; }else{//b空港 while(j < m && b[j] < now) j++; if(j == m) break; cnt++; now = b[j] + y; } } printf("%d\n", cnt / 2); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | Toufukun |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 678 Byte |
Status | AC |
Exec Time | 94 ms |
Memory | 1024 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 | 67 ms | 1024 KB |
subtask0_1.txt | AC | 41 ms | 640 KB |
subtask0_10.txt | AC | 47 ms | 768 KB |
subtask0_11.txt | AC | 54 ms | 896 KB |
subtask0_12.txt | AC | 58 ms | 896 KB |
subtask0_13.txt | AC | 46 ms | 768 KB |
subtask0_14.txt | AC | 57 ms | 896 KB |
subtask0_2.txt | AC | 52 ms | 768 KB |
subtask0_3.txt | AC | 52 ms | 768 KB |
subtask0_4.txt | AC | 51 ms | 768 KB |
subtask0_5.txt | AC | 38 ms | 640 KB |
subtask0_6.txt | AC | 66 ms | 1024 KB |
subtask0_7.txt | AC | 54 ms | 896 KB |
subtask0_8.txt | AC | 39 ms | 640 KB |
subtask0_9.txt | AC | 68 ms | 1024 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 | 94 ms | 896 KB |
subtask1_1.txt | AC | 85 ms | 896 KB |
subtask1_10.txt | AC | 59 ms | 640 KB |
subtask1_11.txt | AC | 82 ms | 896 KB |
subtask1_12.txt | AC | 92 ms | 896 KB |
subtask1_13.txt | AC | 93 ms | 896 KB |
subtask1_14.txt | AC | 73 ms | 768 KB |
subtask1_2.txt | AC | 89 ms | 896 KB |
subtask1_3.txt | AC | 76 ms | 768 KB |
subtask1_4.txt | AC | 84 ms | 896 KB |
subtask1_5.txt | AC | 86 ms | 896 KB |
subtask1_6.txt | AC | 82 ms | 896 KB |
subtask1_7.txt | AC | 81 ms | 896 KB |
subtask1_8.txt | AC | 83 ms | 896 KB |
subtask1_9.txt | AC | 94 ms | 896 KB |