Submission #1865184
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<(n);i++)
#define For(i,a,b) for(i=(a);i<(b);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const double PI=acos(-1.0);
int main(){
int i,j;
int n,m,x,y;
cin >> n >> m >> x >> y;
vector<int> a(n+1,0),b(m+1,0);
rep(i,n) scanf("%d",&a[i+1]);
rep(i,m) scanf("%d",&b[i+1]);
int ap=0,time=0;
int ans=0;
//cout << a[n] << " " << b[m] << endl;
while(1){
if(ap==0){//ap a
if(time>a[n]) break;
i=distance(a.begin(),lower_bound(a.begin()+1,a.end(),time));
time=a[i]+x;
ap=1;
}else{
//cout << time << endl;
if(time>b[m]) break;
i=distance(b.begin(),lower_bound(b.begin()+1,b.end(),time));
time=b[i]+y;
ap=0;
ans++;
}
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 飛行機乗り |
User |
kimitsu_emt |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
879 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:15:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,n) scanf("%d",&a[i+1]);
^
./Main.cpp:16:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,m) scanf("%d",&b[i+1]);
^
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 |
19 ms |
1024 KB |
subtask0_1.txt |
AC |
12 ms |
640 KB |
subtask0_10.txt |
AC |
14 ms |
768 KB |
subtask0_11.txt |
AC |
15 ms |
896 KB |
subtask0_12.txt |
AC |
17 ms |
896 KB |
subtask0_13.txt |
AC |
13 ms |
768 KB |
subtask0_14.txt |
AC |
16 ms |
896 KB |
subtask0_2.txt |
AC |
15 ms |
768 KB |
subtask0_3.txt |
AC |
16 ms |
768 KB |
subtask0_4.txt |
AC |
14 ms |
768 KB |
subtask0_5.txt |
AC |
11 ms |
640 KB |
subtask0_6.txt |
AC |
19 ms |
1024 KB |
subtask0_7.txt |
AC |
15 ms |
896 KB |
subtask0_8.txt |
AC |
11 ms |
640 KB |
subtask0_9.txt |
AC |
20 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 |
26 ms |
896 KB |
subtask1_1.txt |
AC |
22 ms |
896 KB |
subtask1_10.txt |
AC |
16 ms |
640 KB |
subtask1_11.txt |
AC |
19 ms |
896 KB |
subtask1_12.txt |
AC |
25 ms |
896 KB |
subtask1_13.txt |
AC |
24 ms |
896 KB |
subtask1_14.txt |
AC |
17 ms |
768 KB |
subtask1_2.txt |
AC |
20 ms |
896 KB |
subtask1_3.txt |
AC |
21 ms |
768 KB |
subtask1_4.txt |
AC |
22 ms |
896 KB |
subtask1_5.txt |
AC |
20 ms |
896 KB |
subtask1_6.txt |
AC |
23 ms |
896 KB |
subtask1_7.txt |
AC |
21 ms |
896 KB |
subtask1_8.txt |
AC |
19 ms |
896 KB |
subtask1_9.txt |
AC |
25 ms |
896 KB |