这里我直接用了区间修改加单点查询，为什么 wa 加 re。大佬求条。

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e6+10;
int a[N],c[N],C[N],D[N],x[N],y[N];
int n,m,s,t;
int lowbit(int x){
	return x&(-x);
}
void modify(int x,int k){
	for(int i= x;i<=s;i+=lowbit(i)){
		c[i]+=k;
	}
}
int query(int x){
	int ans=0;
	for(int i=x;i>0;i-=lowbit(i)){
		ans+=c[i];
	}
	return ans;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
//	freopen("railway.in","r",stdin);
//	freopen("railway.out","w",stdout);
	cin>>s>>t>>m>>n;
	swap(n,m);
	for(int i=1;i<=t;i++){
		cin>>x[i]>>y[i];
	}
//	cout<<"***"<<endl;
	for(int i=1;i<=t;i++){
		if(x[i]>y[i]){
			swap(x[i],y[i]);
		}
//		cout<<x[i]<<" "<<y[i]<<" "<<i<<"***"<<endl;
		modify(x[i]+1,1);
		modify(y[i]+2,-1);
	}
//	cout<<endl;
//	cout<<query(650)<<endl;
	for(int i=1;i<=n;i++){
		cin>>C[i];
	}
	for(int i=1;i<=m;i++){
		cin>>D[i];
	}
//	cout<<"***"<<endl;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			int cc=C[i],dd=D[j];
			if(cc>dd){
				swap(cc,dd);
			}
			int jl=s-dd+cc;
			float place=dd-cc+(float)jl/2.0;
//			cout<<place<<endl;
			int yi=query((int)place+1),er=query((int)place+2),san=query((int)place);
//			cout<<yi<<" "<<er<<" "<<san<<endl;
			if(place-(int)place==0){
				if(yi&(er==0||san==0)){
					continue;
				}
				if(yi){
					cout<<"YES"<<endl;
					return 0;
				}
			}else{
				if(er&&yi){
					cout<<"YES"<<endl;
					return 0;
				}
			}
		}
	}
	cout<<"NO"<<endl;
	return 0;
}
/*
5 4
0 0 0 0 0
1 1 2 1
1 4 5 1
2 1
2 3
*/