Submission #1839592

---

Source Code Expand

#include <stdlib.h>
#include <stdio.h>
#include <iostream>
using namespace std;

int n,m,x,y;
long a[100000],b[100000];

int binscha(int x,int p, int q){
    int res;
    int c=(p+q)/2;
    if (c==p) {
        if (a[p]>=x) res =p;
        else if(a[q]>=x) res =q;
        else res=-1;
    }
    if (q-p>1){
        if (a[c]<x) res =binscha(x,c,q);
        else if (a[c]>x) res =binscha(x,p,c);
        else if (a[c]==x) res =c;
    }
    return res;
}

int binschb(int x,int p, int q){
    int res;
    int c=(p+q)/2;
    if (c==p) {
        if (b[p]>=x) res =p;
        else if(b[q]>=x) res =q;
        else res=-1;
    }
    if (q-p>1){
        if (b[c]<x) res =binschb(x,c,q);
        else if (b[c]>x) res =binschb(x,p,c);
        else if (b[c]==x) res =c;
    }
    return res;
}


int main () {
    cin >>n>>m>>x>>y;
    for (int i=0;i<n;i++) cin >>a[i];
    for (int i=0;i<m;i++) cin >>b[i];
    
    int t=a[0],s=0,ans=0;
    
    while (s>=0){
        
        s=binschb(t+x,0,m-1);
        if (s<0) break;
        t=b[s]; ans++;
        s=binscha(t+y,0,n-1);
        if (s<0) break;
        t=a[s];
        
    }
    
    cout <<ans<<endl;
    
    
}

Submission Info

Judge Result