Submission #1833079

---

Source Code Expand

#include <bits/stdc++.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)

typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,P> PP;

struct edge {
	int to,cost;
	edge(int t,ll c):to(t),cost(c) {}
};

int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};

ll mypow(ll x,ll n,ll m) {
	if(n==0) return 1;
	if(n%2==0) return mypow(x*x%m,n/2,m);
	else return x*mypow(x,n-1,m)%m;
}

//-----------------------------------------------------------------------------

int n,m;
ll x,y,a[100000],b[100000];
int cnt;

void dfs(int apos,int bpos) {
	while (bpos<m) {
		if(b[bpos]-a[apos]>=x) {
			break;
		}
		bpos++;
	}
	if(bpos==m) return;
	while (apos<n) {
		if(a[apos]-b[bpos]>=y) {
			break;
		}
		apos++;
	}
	if(apos==n) {
		cnt++;
		return;
	}
	cnt++;
	dfs(apos,bpos);
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n>>m>>x>>y;
	REP(i,n) cin>>a[i];
	REP(i,m) cin>>b[i];

	dfs(0,0);
	cout<<cnt<<endl;

	return 0;
}

Submission Info

Judge Result