Submission #1129991
Source Code Expand
#include<iostream> #include<algorithm> #include<cstdio> #include<cstdlib> #include<cmath> #include<vector> #include<map> #include<numeric> #include<queue> #include<string> #include<sstream> using namespace std; int main(void) { int 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]; int now = 0; int nn = 0; int mm = 0; bool isA = true; int cnt = 0; while(true){ if( isA ){ if( now > a[n-1] ) break; now = *lower_bound(a.begin(), a.end(), now) + x; isA = false; }else{ if( now > b[m-1] ) break; now = *lower_bound(b.begin(), b.end(), now) + y; isA = true; cnt++; } } cout << cnt << endl; return 0; } //
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | yut071 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 855 Byte |
Status | AC |
Exec Time | 77 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 | 53 ms | 1024 KB |
subtask0_1.txt | AC | 33 ms | 640 KB |
subtask0_10.txt | AC | 38 ms | 768 KB |
subtask0_11.txt | AC | 43 ms | 896 KB |
subtask0_12.txt | AC | 47 ms | 896 KB |
subtask0_13.txt | AC | 37 ms | 768 KB |
subtask0_14.txt | AC | 46 ms | 896 KB |
subtask0_2.txt | AC | 41 ms | 768 KB |
subtask0_3.txt | AC | 42 ms | 768 KB |
subtask0_4.txt | AC | 40 ms | 768 KB |
subtask0_5.txt | AC | 31 ms | 640 KB |
subtask0_6.txt | AC | 53 ms | 1024 KB |
subtask0_7.txt | AC | 43 ms | 896 KB |
subtask0_8.txt | AC | 31 ms | 640 KB |
subtask0_9.txt | AC | 55 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 | 77 ms | 896 KB |
subtask1_1.txt | AC | 69 ms | 896 KB |
subtask1_10.txt | AC | 46 ms | 640 KB |
subtask1_11.txt | AC | 63 ms | 896 KB |
subtask1_12.txt | AC | 72 ms | 896 KB |
subtask1_13.txt | AC | 74 ms | 896 KB |
subtask1_14.txt | AC | 55 ms | 768 KB |
subtask1_2.txt | AC | 68 ms | 896 KB |
subtask1_3.txt | AC | 60 ms | 768 KB |
subtask1_4.txt | AC | 67 ms | 896 KB |
subtask1_5.txt | AC | 64 ms | 896 KB |
subtask1_6.txt | AC | 66 ms | 896 KB |
subtask1_7.txt | AC | 64 ms | 896 KB |
subtask1_8.txt | AC | 63 ms | 896 KB |
subtask1_9.txt | AC | 74 ms | 896 KB |