Problem p03685 (C++)

Buggy submission (status: Runtime Error):
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void PR(bool f) {
  cout << (f ? "YES" : "NO") << "\n";
  exit(0);
}

struct Point {
  ll idx;
  ll x;
  ll y;
  ll pr;
  static ll R;
  static ll C;
  Point(ll idx_, ll x_, ll y_) : idx(idx_), x(x_), y(y_) {
    if (y == 0)
      pr = 0;
    else if (x == R)
      pr = 1;
    else if (y == C)
      pr = 2;
    else if (x == 0)
      pr = 3;
    else {
      print();
      exit(0);
    }
  }
  bool operator<(const Point &r) {
    if (pr == r.pr) {
      if (pr == 0)
        return x < r.x;
      if (pr == 1)
        return y < r.y;
      if (pr == 2)
        return x > r.x;
      if (pr == 3)
        return y > r.x;
      return false;
    } else {
      return pr < r.pr;
    }
  }
};
ll Point::R;
ll Point::C;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);

  ll r, c, n;
  cin >> r >> c >> n;
  Point::R = r;
  Point::C = c;
  vector<Point> p;
  auto f = [](ll a, ll b) -> bool { return a == 0 || a == b; };
  rep(i, n) {
    ll w, x, y, z;
    cin >> w >> x >> y >> z;
    if ((f(w, r) || f(x, c)) && (f(y, r) || f(z, c))) {
      p.emplace_back(i, w, x);
      p.emplace_back(i, y, z);
    }
  }
  sort(ALL(p));
  rep(i, SZ(p)) { dump(p[i].idx, p[i].x, p[i].y, p[i].pr); }
  vi stat(n, -1);
  ll cntall = 0;
  rep(i, SZ(p)) {
    ll j = p[i].idx;
    if (stat[j] == -1) {
      stat[j] = cntall;
      cntall++;
    } else {
      cntall--;
      if (cntall != stat[j]) {
        PR(0);
      }
    }
  }
  PR(1);
}


Fixed submission:
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void PR(bool f) {
  cout << (f ? "YES" : "NO") << "\n";
  exit(0);
}

struct Point {
  ll idx;
  ll x;
  ll y;
  ll pr;
  static ll R;
  static ll C;
  Point(ll idx_, ll x_, ll y_) : idx(idx_), x(x_), y(y_) {
    if (y == 0)
      pr = 0;
    else if (x == R)
      pr = 1;
    else if (y == C)
      pr = 2;
    else if (x == 0)
      pr = 3;
    else {
      print();
      exit(0);
    }
  }
  bool operator<(const Point &r) {
    if (pr == r.pr) {
      if (pr == 0)
        return x < r.x;
      if (pr == 1)
        return y < r.y;
      if (pr == 2)
        return x > r.x;
      if (pr == 3)
        return y > r.y;
      return false;
    } else {
      return pr < r.pr;
    }
  }
};
ll Point::R;
ll Point::C;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);

  ll r, c, n;
  cin >> r >> c >> n;
  Point::R = r;
  Point::C = c;
  vector<Point> p;
  auto f = [](ll a, ll b) -> bool { return a == 0 || a == b; };
  rep(i, n) {
    ll w, x, y, z;
    cin >> w >> x >> y >> z;
    if ((f(w, r) || f(x, c)) && (f(y, r) || f(z, c))) {
      p.emplace_back(i, w, x);
      p.emplace_back(i, y, z);
    }
  }
  sort(ALL(p));
  rep(i, SZ(p)) { dump(p[i].idx, p[i].x, p[i].y, p[i].pr); }
  vi stat(n, -1);
  ll cntall = 0;
  rep(i, SZ(p)) {
    ll j = p[i].idx;
    if (stat[j] == -1) {
      stat[j] = cntall;
      cntall++;
    } else {
      cntall--;
      if (cntall != stat[j]) {
        PR(0);
      }
    }
  }
  PR(1);
}