Submission #536365

---

Source Code Expand

//include
//------------------------------------------
#include <bits/stdc++.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long long toLL(string s) {long long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
#define CLR(a) memset((a), 0 ,sizeof(a))

const double EPS=1e-9;

LL a[100004],b[100004];

int main(){
	int N,M;
	cin>>N>>M;
	LL X,Y;
	cin>>X>>Y;
	REP(i,N)cin>>a[i];
	REP(i,M)cin>>b[i];
	bool sidea=1;
	LL tm=0;
	LL res=0;
	while((sidea==1&&tm<=a[N-1])||(sidea==0&&tm<=b[M-1])){
		if(sidea){
			LL val=*lower_bound(a,a+N,tm);
			tm=val+X;sidea=0;
		}else{
			LL val=*lower_bound(b,b+M,tm);
			tm=val+Y;
			sidea=1;res++;
		}
	}
	cout<<res<<endl;
	return 0;
	
}

Submission Info

Judge Result