Submission #3067267

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

ll R, C, N;
vi _x1, _y1, _x2, _y2;

ll f(ll a, ll b){
    if (a == 0) {
        return b;
    } else if (a == R) {
        return C+R+(C-b);
    }
    if (b == 0) {
        return C+R+C+(R-a);
    } else if (b == C) {
        return C+a;
    }
    return -1;
}

bool solve() {
    vector<pair<ll,int>> tmp;
    rep(i,N){
        ll p1 = f(_x1[i], _y1[i]),
           p2 = f(_x2[i], _y2[i]);
        if (p1 == -1 || p2 == -1) continue;
        tmp.pb(cons(p1,1+i)); tmp.pb(cons(p2,1+i));
        // printf("%d: %lld - %lld\n", 1+i, p1, p2);
    }
    sort(ALL(tmp));
#ifdef DEBUG
    cerr << tmp << endl;
#endif
    stack<int> st;
    for (auto p : tmp) {
        int x = p.second;
        if (!st.empty() && st.top() == x) st.pop();
        else st.push(x);
    }
    return st.empty();
}

int main() {
    cin >> R >> C >> N;
    _x1.resize(N);
    _y1.resize(N);
    _x2.resize(N);
    _y2.resize(N);
    rep(i,N){
        cin >> _x1[i] >> _y1[i] >> _x2[i] >> _y2[i];
    }
    cout << (solve() ? "YES":"NO") << endl;
    return 0;
}

Submission Info

Submission Time
Task E - Connected?
User naoya_t
Language C++14 (GCC 5.4.1)
Score 700
Code Size 3566 Byte
Status
Exec Time 163 ms
Memory 8048 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:87:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt, s4.txt
All 700 / 700 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 43.txt, 44.txt, 45.txt, 46.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt 136 ms 6768 KB
02.txt 141 ms 3956 KB
03.txt 145 ms 3956 KB
04.txt 139 ms 2936 KB
05.txt 145 ms 3956 KB
06.txt 143 ms 7024 KB
07.txt 144 ms 2428 KB
08.txt 144 ms 4080 KB
09.txt 146 ms 3956 KB
10.txt 146 ms 7792 KB
11.txt 144 ms 7280 KB
12.txt 142 ms 1792 KB
13.txt 141 ms 2428 KB
14.txt 132 ms 3956 KB
15.txt 142 ms 3956 KB
16.txt 145 ms 2176 KB
17.txt 148 ms 1920 KB
18.txt 142 ms 1920 KB
19.txt 142 ms 2936 KB
20.txt 145 ms 6768 KB
21.txt 146 ms 3956 KB
22.txt 143 ms 3956 KB
23.txt 151 ms 7408 KB
24.txt 148 ms 7280 KB
25.txt 146 ms 8048 KB
26.txt 149 ms 7024 KB
27.txt 149 ms 6896 KB
28.txt 139 ms 6768 KB
29.txt 147 ms 6896 KB
30.txt 163 ms 6256 KB
43.txt 1 ms 256 KB
44.txt 1 ms 256 KB
45.txt 1 ms 256 KB
46.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB
s4.txt 1 ms 256 KB