Submission #1129989

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<numeric>
#include<queue>
#include<string>
#include<sstream>

using namespace std;


int main(void) {

  int n, m, x, y;
  cin >> n >> m >> x >> y;
  vector<int> a(n);
  vector<int> b(m);
  for(int i=0; i<n; i++) cin >> a[i];
  for(int i=0; i<m; i++) cin >> b[i];

  int now = 0;
  int nn = 0;
  int mm = 0;
  bool isA = true;

  int cnt = 0;
  int l = 0;
  while(true){
    l++;
    if( l > 100 ) break;
    if( nn == n || mm == m ) break;

    if( isA ){
      if( now > a[n-1] ) break;
      now = *lower_bound(a.begin(), a.end(), now) + x;
      isA = false;
    }else{
      if( now > b[m-1] ) break;
      now = *lower_bound(b.begin(), b.end(), now) + y;
      isA = true;
      cnt++;
    }
  }
  cout << cnt << endl;
  return 0;
}










//

Submission Info

Judge Result