Submission #1687953
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> Array;
typedef vector<vector<ll>> DArray;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
#define rep(i,n) repl(i,0,n-1)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount
#define ssort(x) sort(all(x))
#define mkpair(x,y) make_pair(x,y)
#define lb(x,y) lower_bound(all(x),y)
#define ub(x,y) upper_bound(all(x),y)
#define INF INT_MAX/3
int main(){
cin.sync_with_stdio(false);
int n,m;
int x,y;
cin >> n >> m;
cin >> x >> y;
Array a(n);
Array b(m);
rep(i,n)cin >> a[i];
rep(i,m)cin >> b[i];
ssort(a);
ssort(b);
int time=0;
int current = 0;
int count = 0;
bool end = false;
while(true){
if(current == 0){
auto itr = lb(a,time);
if(itr == a.end())end=true;
else {
time = *itr+x;
current = 1;
}
}else{
auto itr = lb(b,time);
if(itr == b.end())end=true;
else {
time = *itr+y;
current = 0;
count++;
}
}
if(end)break;
}
cout << count << endl;
}
Submission Info
Submission Time |
|
Task |
C - 飛行機乗り |
User |
hayabusa104 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1551 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
1792 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 |
20 ms |
1664 KB |
subtask0_1.txt |
AC |
12 ms |
1152 KB |
subtask0_10.txt |
AC |
14 ms |
1280 KB |
subtask0_11.txt |
AC |
16 ms |
1408 KB |
subtask0_12.txt |
AC |
18 ms |
1536 KB |
subtask0_13.txt |
AC |
13 ms |
1280 KB |
subtask0_14.txt |
AC |
17 ms |
1536 KB |
subtask0_2.txt |
AC |
15 ms |
1408 KB |
subtask0_3.txt |
AC |
16 ms |
1408 KB |
subtask0_4.txt |
AC |
15 ms |
1408 KB |
subtask0_5.txt |
AC |
12 ms |
1152 KB |
subtask0_6.txt |
AC |
20 ms |
1664 KB |
subtask0_7.txt |
AC |
16 ms |
1408 KB |
subtask0_8.txt |
AC |
12 ms |
1152 KB |
subtask0_9.txt |
AC |
21 ms |
1792 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 |
1664 KB |
subtask1_1.txt |
AC |
22 ms |
1536 KB |
subtask1_10.txt |
AC |
16 ms |
1152 KB |
subtask1_11.txt |
AC |
21 ms |
1536 KB |
subtask1_12.txt |
AC |
25 ms |
1664 KB |
subtask1_13.txt |
AC |
25 ms |
1664 KB |
subtask1_14.txt |
AC |
17 ms |
1280 KB |
subtask1_2.txt |
AC |
21 ms |
1536 KB |
subtask1_3.txt |
AC |
21 ms |
1408 KB |
subtask1_4.txt |
AC |
22 ms |
1536 KB |
subtask1_5.txt |
AC |
20 ms |
1536 KB |
subtask1_6.txt |
AC |
23 ms |
1536 KB |
subtask1_7.txt |
AC |
21 ms |
1408 KB |
subtask1_8.txt |
AC |
20 ms |
1536 KB |
subtask1_9.txt |
AC |
26 ms |
1664 KB |