Submission #3415996

---

Source Code Expand

#include<bits/stdc++.h>
#define maxn 200005
using namespace std;
typedef long long LL;
int read()
{
    char c=getchar();int f=1,sum=0;
    while(c<'0' || c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0' && c<='9'){sum=sum*10+c-'0';c=getchar();}
    return sum*f;
}
int r,c,n;
struct point{
	int id,x,y;
}p[maxn];
int tot,top;
int s[maxn];
bool onedge(point x){return !x.x||!x.y||x.x==r||x.y==c;}
int calc(point x)
{
	if(x.y==0) return x.x;
    if(x.x==r) return r+x.y;
    if(x.y==c) return 2*r+c-x.x;
	if(x.x==0) return 2*r+2*c-x.y;
}
bool cmp(point x,point y){return calc(x)<calc(y);}
int main()
{
	r=read();c=read();n=read();
	for(int i=1;i<=n;i++)
	{
		point x1,x2;
		x1.id=x2.id=i;
		x1.x=read();x1.y=read();
		x2.x=read();x2.y=read();
		if(onedge(x1) && onedge(x2)) p[++tot]=x1,p[++tot]=x2;
	}
	sort(p+1,p+1+tot,cmp);
	for(int i=1;i<=tot;i++)
	{
		if(top && s[top]==p[i].id) top--;
		else s[++top]=p[i].id;
	}
	puts(top?"NO":"YES");
	return 0;
}

Submission Info

Judge Result