Submission #1839943

---

Source Code Expand

#include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define all(X) (X).begin(),(X).end()
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

const int MAX_N = 1e5, MAX_M = 1e5;

int N, M;
int X, Y;
int a[MAX_N], b[MAX_M];

int main() {
  cin >> N >> M >> X >> Y;
  rep(i,N) cin >> a[i];
  rep(i,M) cin >> b[i];

  int ans = 0, now = 0;
  while(true) {
    int k = lower_bound(a, a+N, now) - a;
    if (k == N) break;
    now = a[k] + X;
    k = lower_bound(b, b+M, now) -b;
    if (k == M) break;
    now = b[k] + Y;
    ++ans;
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result