Submission #536364

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define PI 3.14159265258979
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
	return a.second > b.second;
}
vector<int> v;

void calc(){
	
}

void solve() {
	int n, m, x, y;
	cin >> n >> m >> x >> y;
	queue<int> A, B;
	rep(i, n){
		int a;
		cin >> a;
		A.push(a);
	}
	rep(i, m){
		int b;
		cin >> b;
		B.push(b);
	}
	int count = 0;
	int time = 0;
	bool turn = true;//true = A , false = B
	while (true){
		if (turn){
			while (!A.empty() && A.front() < time){
				A.pop();
			}
			if (A.empty()){
				break;
			}
			time = A.front();
			A.pop();
			time += x;
			turn = false;
		}
		else{
			while (!B.empty() && B.front() < time ){
				B.pop();
			}
			if (B.empty()){
				break;
			}
			time = B.front();
			B.pop();
			time += y;
			turn = true;
			count++;
		}
	}
	P(count);
}

int main() {
	solve();
	return 0;
}

Submission Info

Judge Result