Submission #1839448

---

Source Code Expand

#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>

#define rep(index,max) for(int index=0;index<max;index++)

using namespace std;

int main(){
    int n,m,x,y;
    vector<int> a;
    vector<int> b;
    int ans=0;
    int t=0;
    cin>>n>>m;
    cin>>x>>y;
    rep(i,n){int tmp;cin>>tmp;a.push_back(tmp);}
    rep(i,m){int tmp;cin>>tmp;b.push_back(tmp);}
    vector<int>::iterator itr=a.begin();
    
    while(1){
        t=*itr+n;
        if(binary_search(b.begin(),b.end(),t)) itr=lower_bound(b.begin(),b.end(),t);
        else break;
        t=*itr+m;
        if(binary_search(a.begin(),a.end(),t)) itr=lower_bound(a.begin(),a.end(),t);
        else break;
        ans++;
    }
    
    cout<<ans<<endl;
    
    return 0;
}

Submission Info

Judge Result