Problem p02680 (C++) — buggy submission, verdict: Time Limit Exceeded

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

// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)

#define whole(f, x, ...)                                                       \\
  ([&](decltype((x)) container) {                                              \\
    return (f)(begin(container), end(container), ##__VA_ARGS__);               \\
  })(x)
#define rwhole(f, x, ...)                                                      \\
  ([&](decltype((x)) container) {                                              \\
    return (f)(rbegin(container), rend(container), ##__VA_ARGS__);             \\
  })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod = 1e9 + 7;
constexpr i32 inf = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup {
  IoSetup(int x = 15) {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(x);
    cerr << fixed << setprecision(x);
  }
} iosetup;

template <typename T = i64> T input() {
  T x;
  cin >> x;
  return x;
}

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
  range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); }
  return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v)
    is >> in;
  return is;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T> vector<T> make_vector(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_vector(size_t a, Ts... ts) {
  return vector<decltype(make_vector(ts...))>(a, make_vector(ts...));
}

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
// }}}

void solver() {
  int n, m;
  cin >> n >> m;

  vector<i64> as(n), bs(n), cs(n);
  vector<i64> ds(m), es(m), fs(m);
  vector<i64> xs{0}, ys{0};

  range(i, 0, n) {
    cin >> as[i] >> bs[i] >> cs[i];
    ys.push_back(as[i]);
    ys.push_back(bs[i]);
    xs.push_back(cs[i]);
  }

  range(i, 0, m) {
    cin >> ds[i] >> es[i] >> fs[i];
    ys.push_back(ds[i]);
    xs.push_back(es[i]);
    xs.push_back(fs[i]);
  }

  whole(sort, xs);
  whole(sort, ys);
  xs.erase(whole(unique, xs), xs.end());
  ys.erase(whole(unique, ys), ys.end());

  range(i, 0, n) {
    as[i] = whole(lower_bound, ys, as[i]) - ys.begin();
    bs[i] = whole(lower_bound, ys, bs[i]) - ys.begin();
    cs[i] = whole(lower_bound, xs, cs[i]) - xs.begin();
  }

  range(i, 0, m) {
    ds[i] = whole(lower_bound, ys, ds[i]) - ys.begin();
    es[i] = whole(lower_bound, xs, es[i]) - xs.begin();
    fs[i] = whole(lower_bound, xs, fs[i]) - xs.begin();
  }

  int H = ys.size() * 2 + 1;
  int W = xs.size() * 2 + 1;
  auto area = make_vector(H, W, infll);
  range(i, 0, H) range(j, 0, W) {
    if (i % 2 == 1 || j % 2 == 1) {
      area[i][j] = 0;
    }
  }

  range(i, 1, H - 1) range(j, 1, W - 1) {
    if (i % 2 == 1 || j % 2 == 1)
      continue;
    area[i][j] = (ys[(i + 1) / 2] - ys[(i - 1) / 2]) *
                 (xs[(j + 1) / 2] - xs[(j - 1) / 2]);
  }

  range(i, 0, n) {
    range(j, 2 * as[i] + 1, 2 * bs[i] + 2) { area[j][2 * cs[i] + 1] = -1; }
  }

  range(i, 0, m) {
    range(j, 2 * es[i] + 1, 2 * fs[i] + 2) { area[2 * ds[i] + 1][j] = -1; }
  }

  int zy = whole(lower_bound, ys, 0) - ys.begin();
  int zx = whole(lower_bound, xs, 0) - xs.begin();
  zy = 2 * zy + 1;
  zx = 2 * zx + 1;

  i64 ans = 0;
  auto used = make_vector(H, W, false);
  queue<pair<int, int>> que;

  used[zy][zx] = true;
  que.emplace(zy, zx);

  while (!que.empty()) {
    int y, x;
    tie(y, x) = que.front();
    que.pop();

    if (area[y][x] == infll) {
      cout << "INF" << endl;
      return;
    }

    ans += area[y][x];

    range(i, 0, 4) {
      int ny = y + dy[i];
      int nx = x + dx[i];
      if (ny < 0 || H <= ny || nx < 0 || W <= nx)
        continue;
      if (area[ny][nx] == -1)
        continue;
      if (used[ny][nx])
        continue;
      used[ny][nx] = true;
      que.emplace(ny, nx);
    }
  }

  cout << ans << endl;
}

signed main(int argc, char *argv[]) { solver(); }


Error: TLE

Fixed submission:

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

// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)

#define whole(f, x, ...)                                                       \\
  ([&](decltype((x)) container) {                                              \\
    return (f)(begin(container), end(container), ##__VA_ARGS__);               \\
  })(x)
#define rwhole(f, x, ...)                                                      \\
  ([&](decltype((x)) container) {                                              \\
    return (f)(rbegin(container), rend(container), ##__VA_ARGS__);             \\
  })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod = 1e9 + 7;
constexpr i32 inf = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup {
  IoSetup(int x = 15) {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(x);
    cerr << fixed << setprecision(x);
  }
} iosetup;

template <typename T = i64> T input() {
  T x;
  cin >> x;
  return x;
}

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
  range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); }
  return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v)
    is >> in;
  return is;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T> vector<T> make_vector(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_vector(size_t a, Ts... ts) {
  return vector<decltype(make_vector(ts...))>(a, make_vector(ts...));
}

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
// }}}

// union find {{{
class union_find {

  using data_type = int_fast32_t;
  std::vector<data_type> data_;

public:
  union_find(std::size_t size) : data_(size, -1) {}

  std::size_t size() const { return data_.size(); }

  data_type get_root(data_type x) {
    return (data_[x] < 0 ? x : data_[x] = get_root(data_[x]));
  }

  bool is_root(data_type x) { return x == get_root(x); }

  bool is_same(data_type x, data_type y) { return get_root(x) == get_root(y); }

  void unite(data_type x, data_type y) {
    x = get_root(x);
    y = get_root(y);
    if (x == y)
      return;

    if (data_[x] > data_[y])
      std::swap(x, y);
    data_[x] += data_[y];
    data_[y] = x;
  }

  data_type element_count(data_type x) { return -data_[get_root(x)]; }
};
// }}}

void solver() {
  int n, m;
  cin >> n >> m;

  vector<i64> as(n), bs(n), cs(n);
  vector<i64> ds(m), es(m), fs(m);
  vector<i64> xs{0}, ys{0};

  range(i, 0, n) {
    cin >> as[i] >> bs[i] >> cs[i];
    ys.push_back(as[i]);
    ys.push_back(bs[i]);
    xs.push_back(cs[i]);
  }

  range(i, 0, m) {
    cin >> ds[i] >> es[i] >> fs[i];
    ys.push_back(ds[i]);
    xs.push_back(es[i]);
    xs.push_back(fs[i]);
  }

  whole(sort, xs);
  whole(sort, ys);
  xs.erase(whole(unique, xs), xs.end());
  ys.erase(whole(unique, ys), ys.end());

  range(i, 0, n) {
    as[i] = whole(lower_bound, ys, as[i]) - ys.begin();
    bs[i] = whole(lower_bound, ys, bs[i]) - ys.begin();
    cs[i] = whole(lower_bound, xs, cs[i]) - xs.begin();
  }

  range(i, 0, m) {
    ds[i] = whole(lower_bound, ys, ds[i]) - ys.begin();
    es[i] = whole(lower_bound, xs, es[i]) - xs.begin();
    fs[i] = whole(lower_bound, xs, fs[i]) - xs.begin();
  }

  int H = ys.size() * 2 + 1;
  int W = xs.size() * 2 + 1;
  auto area = make_vector(H, W, infll);
  range(i, 0, H) range(j, 0, W) {
    if (i % 2 == 1 || j % 2 == 1) {
      area[i][j] = 0;
    }
  }

  range(i, 0, n) {
    range(j, 2 * as[i] + 1, 2 * bs[i] + 2) { area[j][2 * cs[i] + 1] = -1; }
  }

  range(i, 0, m) {
    range(j, 2 * es[i] + 1, 2 * fs[i] + 2) { area[2 * ds[i] + 1][j] = -1; }
  }

  range(i, 2, H - 2) range(j, 2, W - 2) {
    if (i % 2 == 1 || j % 2 == 1)
      continue;
    area[i][j] = (ys[(i + 1) / 2] - ys[(i - 1) / 2]) *
                 (xs[(j + 1) / 2] - xs[(j - 1) / 2]);
  }

  union_find uf(H * W);
  auto to_1d = [&](int y, int x) { return y * W + x; };

  range(i, 0, H) range(j, 0, W - 1) {
    if (area[i][j] == -1 || area[i][j + 1] == -1)
      continue;
    uf.unite(to_1d(i, j), to_1d(i, j + 1));
  }

  range(j, 0, W) range(i, 0, H - 1) {
    if (area[i][j] == -1 || area[i + 1][j] == -1)
      continue;
    uf.unite(to_1d(i, j), to_1d(i + 1, j));
  }

  int zy = whole(lower_bound, ys, 0) - ys.begin();
  int zx = whole(lower_bound, xs, 0) - xs.begin();
  zy = 2 * zy + 1;
  zx = 2 * zx + 1;

  i64 ans = 0;
  range(i, 0, H) range(j, 0, W) {
    if (!uf.is_same(to_1d(zy, zx), to_1d(i, j)))
      continue;
    if (area[i][j] == infll) {
      cout << "INF" << endl;
      return;
    }

    ans += area[i][j];
  }

  cout << ans << endl;
}

signed main(int argc, char *argv[]) { solver(); }