Submission #2118832

---

Source Code Expand

//By Ralif Rakhmatullin
#include<iostream>
#include<fstream>
#include<string>
#include<cstring>
#include<math.h>
#include<cassert>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<ctime>
#include<queue>
#include<stack>
#include<set>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<bitset>
#include<valarray>
#include<iterator>
#include<list>
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define S second
#define ld long double
#define F first
#define y1 LOL
#define ld long double
#define pb push_back
#define len length
#define sz size
#define beg begin
const ll INF = (ll)1e18 + 123;
const int inf=(int)2e9 + 123; 
const int mod=1e9+7;
using namespace std;
int n, w, h;
vector<pair<int, int> > v[6];
bool border(int x, int y){
	if(x == 0 || x == h || y == 0 || y == w)
		return 1;
	return 0;
}
int main(){
	unsigned int FOR;
 	asm("rdtsc" : "=A"(FOR));
  	srand(FOR);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	//cout.tie(0);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin >> h >> w >> n;
	for(int i = 1; i <= n; i ++){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if(!border(x1, y1) || !border(x2, y2))
			continue;
		if(x1 == 0){
			v[1].pb(mp(y1, i));
		}else
		if(y1 == w){
			v[2].pb(mp(x1, i));
		}else
		if(x1 == h)
			v[3].pb(mp(y1, i));
		else
		if(y1 == 0)
			v[4].pb(mp(x1, i));
		if(x2 == 0){
			v[1].pb(mp(y2, i));
		}else
		if(y2 == w){
			v[2].pb(mp(x2, i));
		}else
		if(x2 == h)
			v[3].pb(mp(y2, i));
		else
		if(y2 == 0)
			v[4].pb(mp(x2, i));
	}	
	stack<int> s;
	sort(v[1].beg(), v[1].end());
	sort(v[2].beg(), v[2].end());    
	sort(v[3].beg(), v[3].end());    
	sort(v[4].beg(), v[4].end());
	reverse(v[3].beg(), v[3].end());
	reverse(v[4].beg(), v[4].end());
	for(int i = 0; i < v[1].sz(); i ++){
		if(s.sz() && s.top() == v[1][i].S){
			s.pop();
		}else
			s.push(v[1][i].S);
	}
	for(int i = 0; i < v[2].sz(); i ++){
		if(s.sz() && s.top() == v[2][i].S){
			s.pop();
		}else
			s.push(v[2][i].S);
	}
	for(int i = 0; i < v[3].sz(); i ++){
		if(s.sz() && s.top() == v[3][i].S){
			s.pop();
		}else
			s.push(v[3][i].S);
	}
	for(int i = 0; i < v[4].sz(); i ++){
		if(s.sz() && s.top() == v[4][i].S){
			s.pop();
		}else
			s.push(v[4][i].S);
	}
	if(s.sz() > 0)
		cout << "NO";
	else
		cout << "YES";
	return 0;
}

Submission Info

Judge Result