Submission #552164

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>

#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
#define MOD 1000000007

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout.precision(16);

  int N, M;
  int X, Y;
  cin >> N >> M;
  cin >> X >> Y;

  vector<int> airportA(N);
  vector<int> airportB(M);
  REP(i, N) cin >> airportA[i];
  REP(i, M) cin >> airportB[i];

  int res = 0;
  int current = 0;
  bool turn = true;
  vector<int>::iterator it;
  it = lower_bound(airportB.begin(), airportB.end(), airportA[0] + X);
  while(it != airportB.end() && it != airportA.end()) {
      current = *it;
      if(turn) {
          it = lower_bound(airportA.begin(), airportA.end(), current + Y);
          res++;
      } else {
          it = lower_bound(airportB.begin(), airportB.end(), current + X);
      }
      turn = !turn;
  }

  cout << res << endl;
  return 0;
}

Submission Info

Judge Result