Submission #536668

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

ll N, M;
ll X, Y;
ll a[100005];
ll b[100005];
ll ans;

void solve() {
	ll cur = 0;
	while (true) {
		ll p = lower_bound(a, a + N, cur) - a;
		if (p == N) break;
		cur = a[p] + X;

		ll q = lower_bound(b, b + M, cur) - b;
		if (q == M) break;
		cur = b[q] + Y;

		ans++;
	}
	cout << ans << endl;
}

int main() {
	cin >> N >> M;
	cin >> X >> Y;
	rep(i, N) cin >> a[i];
	rep(i, M) cin >> b[i];
	solve();
	return 0;
}

Submission Info

Judge Result