Problem p02680 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < A[i].size(); j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
  cin >> N >> M;
  vector<int> A(N), B(N), C(N);
  vector<int> D(M), E(M), F(M);
  rep(i, N) cin >> A[i] >> B[i] >> C[i];
  rep(i, M) cin >> D[i] >> E[i] >> F[i];
  vector<int> x, y;
  rep(i, N) {
    x.push_back(A[i]);
    x.push_back(B[i]);
    y.push_back(C[i]);
  }
  rep(i, M) {
    x.push_back(D[i]);
    y.push_back(E[i]);
    y.push_back(F[i]);
  }
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  sort(y.begin(), y.end());
  y.erase(unique(y.begin(), y.end()), y.end());
  W = x.size();
  H = y.size();
  K = (H + 1) * (W + 1);
  vector<vector<int>> d(4, vector<int>(K, 1));
  rep(i, N) {
    int Y = lower_bound(y.begin(), y.end(), C[i]) - y.begin();
    int j = lower_bound(x.begin(), x.end(), A[i]) - x.begin();
    while (x[j] < B[i]) {
      d[3][Y * W + j + 1] = 0;
      d[1][(Y + 1) * W + j + 1] = 0;
      j++;
    }
  }
  rep(i, M) {
    int X = lower_bound(x.begin(), x.end(), D[i]) - x.begin();
    int j = lower_bound(y.begin(), y.end(), E[i]) - y.begin();
    while (y[j] < F[i]) {
      d[2][(j + 1) * W + X] = 0;
      d[0][(j + 1) * W + X + 1] = 0;
      j++;
    }
  }
  int sx = lower_bound(x.begin(), x.end(), 0) - x.begin();
  int sy = lower_bound(y.begin(), y.end(), 0) - y.begin();
  int s = sy * W + sx;
  vector<int> S(K);
  rep(i, H + 1) rep(j, W + 1) {
    if (i == 0 || i == H || j == 0 || j == W) {
      S[i * W + j] = LINF;
    } else {
      S[i * W + j] = (y[i] - y[i - 1]) * (x[j] - x[j - 1]);
    }
  }
  int ans = 0;
  queue<int> q;
  q.push(s);
  vector<int> done(K, 0);
  done[s] = 1;
  while (!q.empty()) {
    int i = q.front();
    q.pop();
    if (S[i] == LINF) {
      cout << "INF" << endl;
      return 0;
    } else {
      ans += S[i];
    }
    int x = i % W;
    int y = i / W;
    rep(k, 4) {
      int nx = x + dj[k];
      int ny = y + di[k];
      int j = ny * W + nx;
      if (0 <= nx && nx < W + 1 && 0 <= ny && ny < H + 1 && d[k][i] &&
          !done[j]) {
        done[j] = 1;
        q.push(j);
      }
    }
  }
  cout << ans << endl;
  return 0;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < A[i].size(); j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
  cin >> N >> M;
  vector<int> A(N), B(N), C(N);
  vector<int> D(M), E(M), F(M);
  rep(i, N) cin >> A[i] >> B[i] >> C[i];
  rep(i, M) cin >> D[i] >> E[i] >> F[i];
  vector<int> x, y;
  rep(i, N) {
    x.push_back(A[i]);
    x.push_back(B[i]);
    y.push_back(C[i]);
  }
  rep(i, M) {
    x.push_back(D[i]);
    y.push_back(E[i]);
    y.push_back(F[i]);
  }
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  sort(y.begin(), y.end());
  y.erase(unique(y.begin(), y.end()), y.end());
  W = x.size();
  H = y.size();
  K = (H + 1) * (W + 1);
  vector<vector<int>> G(K, vector<int>(K, 1));
  rep(i, K) G[i][i] = 0;
  vector<int> S(K);
  rep(i, H + 1) rep(j, W + 1) {
    if (i == 0 || i == H || j == 0 || j == W) {
      S[i * W + j] = LINF;
    } else {
      S[i * W + j] = (y[i] - y[i - 1]) * (x[j] - x[j - 1]);
    }
  }
  rep(i, N) {
    int Y = lower_bound(y.begin(), y.end(), C[i]) - y.begin();
    int j = lower_bound(x.begin(), x.end(), A[i]) - x.begin();
    while (x[j] < B[i]) {
      int a = Y * W + j + 1;
      int b = (Y + 1) * W + j + 1;
      G[a][b] = 0;
      G[b][a] = 0;
      j++;
    }
  }
  rep(i, M) {
    int X = lower_bound(x.begin(), x.end(), D[i]) - x.begin();
    int j = lower_bound(y.begin(), y.end(), E[i]) - y.begin();
    while (y[j] < F[i]) {
      int a = (j + 1) * W + X;
      int b = (j + 1) * W + X + 1;
      G[a][b] = 0;
      G[b][a] = 0;
      j++;
    }
  }
  int ans = 0;
  int sx = lower_bound(x.begin(), x.end(), 0) - x.begin();
  int sy = lower_bound(y.begin(), y.end(), 0) - y.begin();
  int s = sy * W + sx;
  vector<int> done(K, 0);
  queue<int> q;
  done[s] = 1;
  q.push(s);
  while (!q.empty()) {
    int a = q.front();
    q.pop();
    if (S[a] == LINF) {
      cout << "INF" << endl;
      return 0;
    } else {
      ans += S[a];
    }
    int x = a % W;
    int y = a / W;
    rep(k, 4) {
      int nx = x + dj[k];
      int ny = y + di[k];
      int j = ny * W + nx;
      if (0 <= nx && nx < W + 1 && 0 <= ny && ny < H + 1 && G[a][j] &&
          (!done[j])) {
        done[j] = 1;
        q.push(j);
      }
    }
  }
  cout << ans << endl;
  return 0;
}