Submission #1239875

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
typedef long long LL;
int main() {
	LL n, m;
	cin >> n >> m;
	LL x, y;
	cin >> x >> y;

	queue<LL>a, b;
	for (int i = 0; i < n; i++) {
		LL c;
		cin >> c;
		a.push(c);
	}
	for (int j = 0; j < m; j++) {
		LL c;
		cin >> c;
		b.push(c);
	}
	LL ans = 0;
	LL now = 1;
	LL tim = a.front()+x;
	a.pop();
	while (1) {
		if (now) {
			if (b.empty())goto F;
			while (b.size()) {
				LL d = b.front();
				b.pop();
				if (tim <= d) {
					tim = d+y;
					now--;
					ans++;
					break;
				}
			}
		}
		else {
			if (a.empty())goto F;
			while (a.size()) {
				LL d = a.front();
				a.pop();
				if (tim <= d) {
					tim = d+x;
					now++;
					break;
				}
			}
		}
	}
	F:
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result