Submission #1839555

---

Source Code Expand

#include <iostream>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
int n[2],x[2];
int d[2][100100];
int search(int a,int id){
    if(d[id][0]>=a)return 0;
    int l=0,r=n[id];
    while(r-l>1){
        int mid=(r+l)/2;
        if(d[id][mid]<a)l=mid;
        else r=mid;
    }
    return l+1;
}
int main(){
    cin>>n[0]>>n[1]>>x[0]>>x[1];
    REP(k,2)REP(i,n[k])cin>>d[k][i];
    int now=0;
    int id=0;
    int cnt=0;
    while(1){
        int t=search(now,id);
        if(t==n[id])break;
        now=d[id][t]+x[id];
        id^=1;
        if(id==0)cnt++;
    }
    cout<<cnt<<endl;
}

Submission Info

Judge Result