Submission #5498098

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include <fstream>
#include <time.h>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define m0(x) memset(x,0,sizeof(x))
#define print(x) cout<<x<<endl;
#define pe(x) cout<<x<<" ";
#define lb(v,n) lower_bound(v.begin(), v.end(), n);
#define ub(v,n) upper_bound(v.begin(), v.end(), n);
#define int long long
#define all(x) (x).begin(), (x).end()

using namespace std;

int MOD = (ll)1000000000 + 7;
ll INF = 1e17;
const double pi = acos(-1);
const double EPS = 1e-10;
const int MAX = 500050;
typedef pair<int, int>P;
struct P2 {
	int x1, x2, y1, y2;
};
bool operator==(const P2& p1, const P2& p2) {
	if (p1.x1 == p2.x1 && p1.y1 == p2.y1 && p1.x2 == p2.x2 && p1.y2 == p2.y2) {
		return true;
	}
	else return false;
}

int R, C, N;
vector<P>v;

bool safe(int x,int y) {
	if (0 < x && x < R) {
		if (0 < y && y < C) {
			return true;
		}
	}
	return false;
}

signed main() {
	cin >> R >> C >> N;
	REP(i, N) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if (!safe(x1, y1) && !safe(x2, y2)) {
			int res1;
			if (x1 == 0) {
				res1 = 2 * R + 2 * C - y1;
			}
			else if (y1 == C) {
				res1 = 2 * R + C - x1;
			}
			else {
				res1 = x1 + y1;
			}

			int res2;
			if (x2 == 0) {
				res2 = 2 * R + 2 * C - y2;
			}
			else if (y2 == C) {
				res2 = 2 * R + C - x2;
			}
			else {
				res2 = x2 + y2;
			}
			v.pb(P(res1, i));
			v.pb(P(res2, i));
			//pe(i)pe(res1)print(res2);
		}
	}
	VSORT(v);
	stack<int>stk;
	if (v.size() == 0) {
		print("YES"); return 0;
	}
	stk.push(v[0].second);
	FOR(i,1, v.size()) {
		if (v[i].second == stk.top())stk.pop();
		else {
			stk.push(v[i].second);
		}
	}
	if (stk.empty())print("YES") else print("NO");
}

Submission Info

Judge Result