Submission #537482

---

Source Code Expand

#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <list>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <iterator> 

using namespace std;

int N, M, X, Y;
#define N_MAX 100000
#define M_MAX 100000

int a[N_MAX+1], b[M_MAX+1];

int main(int argc, char const* argv[])
{
    cin >> N >> M >> X >> Y;
    int i;
    a[0] = b[0] = 0;
    for (i = 1; i <= N; i++) {
        cin >> a[i];
    }
    for (i = 1; i <= M; i++) {
        cin >> b[i];
    }
    int time = 0;
    i = 1;
    int j = 1;
    int count = 0;
    while (true) {
        //cout << time << endl;
        //cout << i << " " << j << endl;
        if (a[N] < time) {
            break;
        }
        while (time > a[i] && i <= N) {
            i++;
        }
        time = a[i] + X;
        if (b[M] < time) {
            break;
        }
        while (time > b[j] && j <= M) {
            j++;
        }
        time = b[j] + Y;
        count += 1;
    }
    cout << count << endl;
    return 0;
}

Submission Info

Judge Result