Submission #2106123

---

Source Code Expand

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

//defines
#define openin freopen("input.txt","r",stdin)
#define openout freopen("output.txt","w",stdout)
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ll long long
#define int long long
#define mod 1000000007
#define repr(i,x,y) for (__typeof(x) i=x;i>=y;i--)
#define rep(i,x,y) for (__typeof(x) i=x;i<=y;i++)
#define all(c) (c).begin(),(c).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair

/* Print pair */
template <typename T,typename S>
ostream & operator << (ostream &os , const pair<T,S> &v) {
    os << "(" ;
    os << v.first << "," << v.second << ")" ;
    return os ;
}
/* Print vector */
template <typename T>
ostream & operator << (ostream &os , const vector<T> &v) {
    os << "[" ;
    int sz = v.size() ;
    for(int i = 0 ; i < sz ; ++i) {
        os << v[i] ;
        if(i!=sz-1)os << "," ;
    }
    os << "]\n" ;
    return os ;
}
/* Print set */
template <typename T>
ostream & operator << (ostream &os , const set<T> &v) {
    T last = *v.rbegin() ;
    os << "[" ;
    for(auto it : v) {
        os << it  ;
        if(it != last) os << "," ;
    }
    os << "]\n" ;
    return os ;
}
/* Print Map */
template <typename T,typename S>
ostream & operator << (ostream &os , const map<T,S> &v) {
    for(auto it : v) {
        os << it.first << " : " << it.second << "\n" ;
    }
    return os ;
}
int power(int a , int b)
{
    int res = 1 ;
    while(b)
    {
        if(b%2) {
            res = (res * a) % mod ;
        }
        b/=2 ;
        a = (a*a) % mod ;
    }
    return res ;
}

//debug
#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
        cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
        const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
int r , c , n ; 
vector<pair<pair<int,int>,int> > arr ; 
bool is(int x , int y) {
    return (x == 0 || y == 0 || y == c || x == r) ;
}
void Insert(int x , int y , int idx) { 
    if(x == 0) arr.pb({{1,y},idx}) ; 
    else if(y == c) arr.pb({{2,x},idx}) ;
    else if(x == r) arr.pb({{3,-y},idx}) ;
    else arr.pb({{4,-x},idx}) ;
}
int32_t main()
{
    fast;
    int idx = 1 ;
    cin >> r >> c >> n ; 
    rep(i,1,n) {
        int x1 , y1 , x2 , y2 ; 
        cin >> x1 >> y1 >> x2 >> y2 ; 
        if(is(x1,y1) && is(x2,y2)) {
            Insert(x1,y1,idx) ;
            Insert(x2,y2,idx) ;
            ++idx ; 
        }
    }
    sort(all(arr)) ;
    stack<int> bla ; 
    for(auto it : arr) {
        if(bla.empty() == false && bla.top() == it.second) bla.pop() ;
        else bla.push(it.second) ;
    }
    if(bla.empty()) cout << "YES\n" ; 
    else cout << "NO\n" ;
    return 0;
}

Submission Info

Judge Result