Submission #1128027

---

Source Code Expand

#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(V),v.end()));
#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };

typedef long long ll;
using namespace std;


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	int x, y;
	cin >> x >> y;
	vector<int> a(n), b(m);
	REP(i, n)cin >> a[i];
	REP(i, m)cin >> b[i];
	int t = 0, flag = 1;
	int cnt = 0;
	sort(ALL(a));
	sort(ALL(b));
	while (1) {
		if (flag) {
			auto p = lower_bound(ALL(a), t);
			if (p != a.end()) {
				t = *p + x;
				flag = 0;
			}
			else {
				cout << cnt << endl;
				return 0;
			}
		}
		else {
			auto p = lower_bound(ALL(b), t);
			if (p != b.end()) {
				t = *p +y;
				flag = 1;
				cnt++;
			}
			else {
				cout << cnt << endl;
				return 0;
			}

		}
	}
	return 0;
}

Submission Info

Judge Result