Submission #537612
Source Code Expand
#include <stdio.h>
int main(){
int res=0;
long long int i,n,m,ai=0,bi=0;
long long int x,y,a[100001],b[100001];
scanf("%lld %lld", &n, &m);
scanf("%lld %lld", &x, &y);
for(i=0;i<n;i++) scanf("%lld",&a[i]);
for(i=0;i<m;i++) scanf("%lld",&b[i]);
for(;;){
for(i=bi;i<m;i++){
if(a[ai]+x <= b[i]){
bi = i;res++;break;
}
}
if(i==m) break;
for(i=ai;i<n;i++){
if(b[bi]+y <= a[i]){
ai = i;break;
}
}
if(i==n) break;
}
printf("%d\n",res);
return 0;
}
Submission Info
Submission Time
2015-10-24 22:20:17+0900
Task
C - 飛行機乗り
User
niconico774
Language
C (GCC 4.9.2)
Score
100
Code Size
510 Byte
Status
AC
Exec Time
66 ms
Memory
2220 KiB
Compile Error
./Main.c: In function ‘main’:
./Main.c:6:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld", &n, &m);
^
./Main.c:7:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld", &x, &y);
^
./Main.c:8:19: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
for(i=0;i<n;i++) scanf("%lld",&a[i]);
^
./Main.c:9:19: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
for(i=0;i<m;i++) scanf("%lld",&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
59 ms
2080 KiB
subtask0_1.txt
AC
43 ms
1568 KiB
subtask0_10.txt
AC
46 ms
1700 KiB
subtask0_11.txt
AC
51 ms
1828 KiB
subtask0_12.txt
AC
54 ms
1956 KiB
subtask0_13.txt
AC
47 ms
1624 KiB
subtask0_14.txt
AC
52 ms
1960 KiB
subtask0_2.txt
AC
50 ms
1832 KiB
subtask0_3.txt
AC
49 ms
1824 KiB
subtask0_4.txt
AC
50 ms
1820 KiB
subtask0_5.txt
AC
45 ms
1604 KiB
subtask0_6.txt
AC
60 ms
2088 KiB
subtask0_7.txt
AC
52 ms
1828 KiB
subtask0_8.txt
AC
44 ms
1576 KiB
subtask0_9.txt
AC
59 ms
2220 KiB
subtask0_sample_01.txt
AC
23 ms
792 KiB
subtask0_sample_02.txt
AC
22 ms
792 KiB
subtask0_sample_03.txt
AC
24 ms
692 KiB
subtask1_0.txt
AC
65 ms
2088 KiB
subtask1_1.txt
AC
62 ms
1944 KiB
subtask1_10.txt
AC
48 ms
1572 KiB
subtask1_11.txt
AC
60 ms
1948 KiB
subtask1_12.txt
AC
64 ms
1952 KiB
subtask1_13.txt
AC
63 ms
2084 KiB
subtask1_14.txt
AC
57 ms
1688 KiB
subtask1_2.txt
AC
64 ms
1960 KiB
subtask1_3.txt
AC
58 ms
1828 KiB
subtask1_4.txt
AC
62 ms
1952 KiB
subtask1_5.txt
AC
61 ms
1876 KiB
subtask1_6.txt
AC
59 ms
1832 KiB
subtask1_7.txt
AC
59 ms
1828 KiB
subtask1_8.txt
AC
60 ms
1948 KiB
subtask1_9.txt
AC
66 ms
2076 KiB