Submission #1825885

---

Source Code Expand

#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
#define int long long
typedef complex<double>P;
int n,l,k,r,r1,t,l1,c,f,a[1000001],b[100001],dp[1<<9],dp2[1<<9];
main(){
  cin>>l>>r;
  int x,y;
  cin>>x>>y;
  r(i,l)cin>>a[i];
  r(i,r)cin>>b[i];
  int z1=0,z2=0;
  while(z1<l&&z2<r){
    if(c%2==0){
      while(a[z1]<t&&z1<l)z1++;
      if(z1!=l)t=a[z1]+x,c++;
    }
    else{
      while(b[z2]<t&&z2<r)z2++;
      if(z2!=r)t=b[z2]+y,c++;
    }
    //cout<<t<<endl;
    //c++;
  }
  cout<<c/2<<endl;
}

Submission Info

Judge Result