Submission #1839531
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main() { unsigned long long ans=0; unsigned long long N,M,X,Y; cin >> N >> M >> X >> Y; unsigned long long a[N], b[M]; for(unsigned long long i=0; i<N; i++){ cin >> a[i]; } for(unsigned long long i=0; i<M; i++){ cin >> b[i]; } sort(a,a+N); sort(b,b+M); unsigned long long t=0, n=0,m=0; while(true){ while(n<=N){ if(a[n]>=t){ t=a[n]+X; break; } n++; } while(m<=M){ if(b[m]>=t){ ans++; t=b[m]+Y; break; } m++; } if(n>N && m>M){break;} } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | monptt |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 644 Byte |
Status | WA |
Exec Time | 74 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 55 ms | 1664 KB |
subtask0_1.txt | AC | 34 ms | 1152 KB |
subtask0_10.txt | AC | 40 ms | 1280 KB |
subtask0_11.txt | AC | 47 ms | 1408 KB |
subtask0_12.txt | AC | 48 ms | 1536 KB |
subtask0_13.txt | AC | 38 ms | 1280 KB |
subtask0_14.txt | AC | 48 ms | 1536 KB |
subtask0_2.txt | AC | 43 ms | 1408 KB |
subtask0_3.txt | AC | 44 ms | 1408 KB |
subtask0_4.txt | AC | 42 ms | 1408 KB |
subtask0_5.txt | AC | 32 ms | 1024 KB |
subtask0_6.txt | AC | 55 ms | 1664 KB |
subtask0_7.txt | AC | 45 ms | 1408 KB |
subtask0_8.txt | AC | 33 ms | 1152 KB |
subtask0_9.txt | AC | 57 ms | 1792 KB |
subtask0_sample_01.txt | WA | 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 | 73 ms | 1664 KB |
subtask1_1.txt | AC | 67 ms | 1536 KB |
subtask1_10.txt | AC | 45 ms | 1152 KB |
subtask1_11.txt | AC | 65 ms | 1536 KB |
subtask1_12.txt | AC | 71 ms | 1536 KB |
subtask1_13.txt | AC | 74 ms | 1664 KB |
subtask1_14.txt | AC | 56 ms | 1280 KB |
subtask1_2.txt | AC | 70 ms | 1536 KB |
subtask1_3.txt | AC | 59 ms | 1408 KB |
subtask1_4.txt | AC | 66 ms | 1536 KB |
subtask1_5.txt | AC | 66 ms | 1536 KB |
subtask1_6.txt | AC | 64 ms | 1408 KB |
subtask1_7.txt | AC | 63 ms | 1408 KB |
subtask1_8.txt | AC | 65 ms | 1536 KB |
subtask1_9.txt | AC | 73 ms | 1664 KB |