Submission #1691704

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,x,y,a[100010],b[100010];

int main(){
	cin >> n >> m >> x >> y;
	REP(i,0,n) cin >> a[i];
	REP(i,0,m) cin >> b[i];
	
	int now=0,c=0,i=0,j=0;
	bool f=true;
	while(1){
		if(f) while(1){
			if(a[i]>=now){c++,now=a[i]+x,i++,f=false; break;}
			else i++;
			if(i>=n){
				cout << c/2 << endl;
				return 0;
			}
		}else while(1){
			if(b[j]>=now){c++,now=b[j]+y,j++,f=true; break;}
			else j++;
			if(j>=m){
				cout << c/2 << endl;
				return 0;
			}
		}
	}
	
	return 0;
}

Submission Info

Judge Result