Submission #1694815

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
#include <set>
#include <utility>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <sstream>
#include <list>
#include <map>

#define rep(i,p,n) for(int i=(int)p;i<(int)n;i++)
#define repp(i,p,n) for(int i=(int)p;i>=(int)n;i--)
#define Sort(x) sort(x.begin(),x.end());
#define ll long long 
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi <vector<vector<vector<int>>> 
#define vc vector<char> 
#define vvc vector<vector<char>>
#define vvvc vector<vector<vector<char>>> 

using namespace std;

int main() {
	int n, m, x, y;
	cin >> n >> m >> x >> y;
	vi v(n);
	vi vv(m);

	rep(i, 0, n) cin >> v[i];
	rep(i, 0, m) cin >> vv[i];

	int sum = 0, count = 1;
	bool judge = false;
	sum = v[0]+x;

	while (true) {
		if (judge) {
			auto itr = lower_bound(v.begin(), v.end(), sum);
			if (itr == v.end()) break;
			sum = *itr+x;
			judge = false;
			count++;
		}
		else {
			auto itr = lower_bound(vv.begin(), vv.end(), sum);
			if (itr == vv.end())break;
			sum = *itr+y;
			judge = true;
			count++;
		}
	}

	cout << count / 2 << endl;



	return 0;
}

Submission Info

Judge Result