Submission #1672134
Source Code Expand
#include<bits/stdc++.h> long long int MOD = 1000000007; using namespace std; //g++ -std=c++14 //setprecision(10) int main(){ int n, m, x, y; cin >> n >> m >> x >> y; int a[n], b[m]; for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < m; i++) cin >> b[i]; int ans = 0; auto iki = a, kaeri = b; while(1){ kaeri = lower_bound(kaeri, b + m, *iki + x); if(kaeri == b + m) break; else{ ans += 1; //cout << *kaeri << endl; } iki = lower_bound(iki, a + n, *kaeri + y); if(iki == a + n) break; else{ //cout << *iki << endl; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | Masumi |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 618 Byte |
Status | AC |
Exec Time | 95 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 | 66 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 | 47 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 | 50 ms | 768 KB |
subtask0_5.txt | AC | 38 ms | 640 KB |
subtask0_6.txt | AC | 66 ms | 1024 KB |
subtask0_7.txt | AC | 53 ms | 896 KB |
subtask0_8.txt | AC | 40 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 | 95 ms | 896 KB |
subtask1_1.txt | AC | 85 ms | 896 KB |
subtask1_10.txt | AC | 64 ms | 640 KB |
subtask1_11.txt | AC | 82 ms | 896 KB |
subtask1_12.txt | AC | 92 ms | 896 KB |
subtask1_13.txt | AC | 94 ms | 896 KB |
subtask1_14.txt | AC | 73 ms | 768 KB |
subtask1_2.txt | AC | 88 ms | 896 KB |
subtask1_3.txt | AC | 77 ms | 768 KB |
subtask1_4.txt | AC | 85 ms | 896 KB |
subtask1_5.txt | AC | 86 ms | 896 KB |
subtask1_6.txt | AC | 82 ms | 896 KB |
subtask1_7.txt | AC | 82 ms | 896 KB |
subtask1_8.txt | AC | 83 ms | 896 KB |
subtask1_9.txt | AC | 95 ms | 896 KB |