Submission #536662
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <string> #include <utility> using namespace std; int main(){ int N,M,X,Y; int a[100000],b[100000]; //input cin >> N >> M >> X >> Y; for(int i=0; i<N; ++i) scanf(" %d", &a[i]); for(int i=0; i<M; ++i) scanf(" %d", &b[i]); //solve int ans=0; int inA=0, inB=0; int now=0; while(1){ now=a[inA]; now+=X; //move //while(inB<M && b[inB]<now) inB++; inB = lower_bound(b, b+M, now)-b; //printf("inB = %d\n", inB); if(inB==M) break; now=b[inB]; now+=Y; ans++; //while(inA<N && a[inA]<now) inA++; inA = lower_bound(a, a+N, now)-a; //printf("inA = %d\n", inA); if(inA==N) break; } printf("%d\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | imulan |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 765 Byte |
Status | AC |
Exec Time | 72 ms |
Memory | 1444 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:14:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0; i<N; ++i) scanf(" %d", &a[i]); ^ ./Main.cpp:15:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0; i<M; ++i) scanf(" %d", &b[i]); ^
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 | 58 ms | 1436 KB |
subtask0_1.txt | AC | 45 ms | 1188 KB |
subtask0_10.txt | AC | 48 ms | 1312 KB |
subtask0_11.txt | AC | 51 ms | 1320 KB |
subtask0_12.txt | AC | 55 ms | 1436 KB |
subtask0_13.txt | AC | 48 ms | 1316 KB |
subtask0_14.txt | AC | 57 ms | 1388 KB |
subtask0_2.txt | AC | 50 ms | 1292 KB |
subtask0_3.txt | AC | 52 ms | 1316 KB |
subtask0_4.txt | AC | 49 ms | 1316 KB |
subtask0_5.txt | AC | 42 ms | 1188 KB |
subtask0_6.txt | AC | 59 ms | 1444 KB |
subtask0_7.txt | AC | 50 ms | 1320 KB |
subtask0_8.txt | AC | 44 ms | 1184 KB |
subtask0_9.txt | AC | 59 ms | 1436 KB |
subtask0_sample_01.txt | AC | 26 ms | 916 KB |
subtask0_sample_02.txt | AC | 26 ms | 792 KB |
subtask0_sample_03.txt | AC | 24 ms | 920 KB |
subtask1_0.txt | AC | 72 ms | 1436 KB |
subtask1_1.txt | AC | 64 ms | 1440 KB |
subtask1_10.txt | AC | 52 ms | 1184 KB |
subtask1_11.txt | AC | 59 ms | 1316 KB |
subtask1_12.txt | AC | 70 ms | 1444 KB |
subtask1_13.txt | AC | 69 ms | 1440 KB |
subtask1_14.txt | AC | 55 ms | 1308 KB |
subtask1_2.txt | AC | 64 ms | 1440 KB |
subtask1_3.txt | AC | 62 ms | 1308 KB |
subtask1_4.txt | AC | 64 ms | 1440 KB |
subtask1_5.txt | AC | 60 ms | 1444 KB |
subtask1_6.txt | AC | 66 ms | 1308 KB |
subtask1_7.txt | AC | 63 ms | 1316 KB |
subtask1_8.txt | AC | 60 ms | 1316 KB |
subtask1_9.txt | AC | 69 ms | 1436 KB |