Submission #11647366

---

Source Code Expand

// Date: 2020-04-07

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define IO freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout)
#define FIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i, a, b) for(int i = int(a); i <= int(b); ++i)
#define per(i, b, a) for(int i = int(b); i >= int(a); --i)
#define D(x) cout << #x << " = " << x << endl;
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)x.size())
#define mk make_pair
#define pb push_back
#define fi first
#define se second
const LL INF = 1e18;
const LL mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
LL qpow(LL x, LL y, LL MOD) {LL a=1; while(y){ if(y&1) a=a*x%MOD; x=x*x%MOD; y>>=1; } return a;}

int n, m, k;
pii a[N];

bool ok(int x, int y) {
    return x == 0 || x == n || y == 0 || y == m;
}

int get(int x, int y) {
    if(!x) return y;
    if(y == m) return m + x;
    if(x == n) return m + n + m - y;
    return m + n + m + n - x;
}

int stk[N], top;
int main() {
    FIO;
    cin >> n >> m >> k;
    int tot = 0;
    rep(i, 1, k) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if(ok(x1, y1) && ok(x2, y2)) {
            a[++tot] = mk(get(x1, y1), i);
            a[++tot] = mk(get(x2, y2), i);
        }
    }
    sort(a+1, a+1+tot);
    rep(i, 1, tot) {
        stk[++top] = a[i].se;
        if(top > 1 && stk[top] == stk[top-1]) top -= 2;
    }
    if(top == 0) cout << "YES";
    else cout << "NO";

    return 0;
}

Submission Info

Judge Result