結果

問題 No.2160 みたりのDominator
ユーザー maspymaspy
提出日時 2022-12-11 01:40:25
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 18,666 bytes
コンパイル時間 5,137 ms
コンパイル使用メモリ 265,832 KB
実行使用メモリ 17,052 KB
最終ジャッジ日時 2023-08-05 03:44:26
合計ジャッジ時間 24,197 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
17,052 KB
testcase_01 AC 1 ms
8,752 KB
testcase_02 AC 1 ms
11,412 KB
testcase_03 AC 1 ms
4,508 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,384 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 1 ms
4,376 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 1 ms
4,376 KB
testcase_19 AC 1 ms
4,376 KB
testcase_20 AC 1 ms
4,380 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 1 ms
4,380 KB
testcase_23 AC 2 ms
4,380 KB
testcase_24 AC 1 ms
4,376 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 1 ms
4,376 KB
testcase_32 AC 1 ms
4,380 KB
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 1 ms
4,376 KB
testcase_35 AC 2 ms
4,384 KB
testcase_36 AC 1 ms
4,380 KB
testcase_37 AC 1 ms
4,376 KB
testcase_38 AC 2 ms
4,376 KB
testcase_39 AC 1 ms
4,380 KB
testcase_40 AC 42 ms
12,816 KB
testcase_41 AC 37 ms
12,956 KB
testcase_42 AC 23 ms
8,308 KB
testcase_43 AC 35 ms
12,356 KB
testcase_44 AC 42 ms
12,864 KB
testcase_45 AC 44 ms
12,792 KB
testcase_46 AC 38 ms
12,612 KB
testcase_47 AC 23 ms
8,312 KB
testcase_48 AC 35 ms
12,228 KB
testcase_49 AC 42 ms
12,904 KB
testcase_50 AC 40 ms
12,840 KB
testcase_51 AC 25 ms
8,836 KB
testcase_52 AC 37 ms
12,256 KB
testcase_53 AC 43 ms
12,992 KB
testcase_54 AC 23 ms
8,180 KB
testcase_55 AC 31 ms
9,184 KB
testcase_56 AC 32 ms
9,476 KB
testcase_57 AC 32 ms
9,020 KB
testcase_58 AC 30 ms
9,872 KB
testcase_59 AC 31 ms
9,476 KB
testcase_60 AC 35 ms
9,972 KB
testcase_61 AC 34 ms
9,932 KB
testcase_62 AC 32 ms
9,640 KB
testcase_63 AC 32 ms
9,744 KB
testcase_64 AC 38 ms
9,684 KB
testcase_65 AC 12 ms
6,124 KB
testcase_66 AC 16 ms
6,552 KB
testcase_67 AC 16 ms
6,644 KB
testcase_68 AC 29 ms
9,368 KB
testcase_69 AC 21 ms
7,632 KB
testcase_70 AC 28 ms
9,300 KB
testcase_71 AC 10 ms
5,736 KB
testcase_72 AC 18 ms
7,560 KB
testcase_73 AC 30 ms
9,300 KB
testcase_74 AC 30 ms
9,876 KB
testcase_75 AC 3 ms
4,376 KB
testcase_76 AC 3 ms
4,376 KB
testcase_77 AC 13 ms
6,780 KB
testcase_78 AC 16 ms
7,536 KB
testcase_79 AC 4 ms
4,380 KB
testcase_80 AC 4 ms
4,380 KB
testcase_81 AC 21 ms
5,168 KB
testcase_82 AC 7 ms
4,972 KB
testcase_83 AC 32 ms
12,060 KB
61_evil_bias_nocross_01.txt AC 44 ms
12,896 KB
61_evil_bias_nocross_02.txt TLE -
61_evil_bias_nocross_03.txt AC 1,875 ms
8,400 KB
61_evil_bias_nocross_04.txt TLE -
61_evil_bias_nocross_05.txt AC 41 ms
13,596 KB
61_evil_bias_nocross_06.txt AC 41 ms
12,828 KB
61_evil_bias_nocross_07.txt AC 24 ms
8,416 KB
61_evil_bias_nocross_08.txt TLE -
61_evil_bias_nocross_09.txt TLE -
61_evil_bias_nocross_10.txt AC 1,671 ms
8,496 KB
61_evil_bias_nocross_11.txt AC 31 ms
11,792 KB
61_evil_bias_nocross_12.txt AC 39 ms
25,964 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "/home/maspy/compro/library/my_template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;

template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
  overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

template <typename T, typename U>
T SUM(const vector<U> &A) {
  T sum = 0;
  for (auto &&a: A) sum += a;
  return sum;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
T pick(deque<T> &que) {
  T a = que.front();
  que.pop_front();
  return a;
}

template <typename T>
T pick(pq<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}

template <typename T>
T pick(pqg<T> &que) {
  assert(que.size());
  T a = que.top();
  que.pop();
  return a;
}

template <typename T>
T pick(vc<T> &que) {
  assert(que.size());
  T a = que.back();
  que.pop_back();
  return a;
}

template <typename T, typename U>
T ceil(T x, U y) {
  return (x > 0 ? (x + y - 1) / y : x / y);
}

template <typename T, typename U>
T floor(T x, U y) {
  return (x > 0 ? x / y : (x - y + 1) / y);
}

template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

template <typename F>
ll binary_search(F check, ll ok, ll ng) {
  assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
  }
  return ok;
}

template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  FOR(iter) {
    double x = (ok + ng) / 2;
    tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
  }
  return (ok + ng) / 2;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

vc<int> s_to_vi(const string &S, char first_char) {
  vc<int> A(S.size());
  FOR(i, S.size()) { A[i] = S[i] - first_char; }
  return A;
}

template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
  vc<CNT> C(size);
  for (auto &&x: A) { ++C[x]; }
  return C;
}

// stable
template <typename T>
vector<int> argsort(const vector<T> &A) {
  vector<int> ids(A.size());
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  int n = len(I);
  vc<T> B(n);
  FOR(i, n) B[i] = A[I[i]];
  return B;
}
#line 1 "/home/maspy/compro/library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>

namespace fastio {
// クラスが read(), print() を持っているかを判定するメタ関数
struct has_write_impl {
  template <class T>
  static auto check(T &&x) -> decltype(x.write(), std::true_type{});

  template <class T>
  static auto check(...) -> std::false_type;
};

template <class T>
class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {
};

struct has_read_impl {
  template <class T>
  static auto check(T &&x) -> decltype(x.read(), std::true_type{});

  template <class T>
  static auto check(...) -> std::false_type;
};

template <class T>
class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};

struct Scanner {
  FILE *fp;
  char line[(1 << 15) + 1];
  size_t st = 0, ed = 0;
  void reread() {
    memmove(line, line + st, ed - st);
    ed -= st;
    st = 0;
    ed += fread(line + ed, 1, (1 << 15) - ed, fp);
    line[ed] = '\0';
  }
  bool succ() {
    while (true) {
      if (st == ed) {
        reread();
        if (st == ed) return false;
      }
      while (st != ed && isspace(line[st])) st++;
      if (st != ed) break;
    }
    if (ed - st <= 50) {
      bool sep = false;
      for (size_t i = st; i < ed; i++) {
        if (isspace(line[i])) {
          sep = true;
          break;
        }
      }
      if (!sep) reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    while (true) {
      size_t sz = 0;
      while (st + sz < ed && !isspace(line[st + sz])) sz++;
      ref.append(line + st, sz);
      st += sz;
      if (!sz || st != ed) break;
      reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    bool neg = false;
    if (line[st] == '-') {
      neg = true;
      st++;
    }
    ref = T(0);
    while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
    if (neg) ref = -ref;
    return true;
  }
  template <typename T,
            typename enable_if<has_read<T>::value>::type * = nullptr>
  inline bool read_single(T &x) {
    x.read();
    return true;
  }
  bool read_single(double &ref) {
    string s;
    if (!read_single(s)) return false;
    ref = std::stod(s);
    return true;
  }
  bool read_single(char &ref) {
    string s;
    if (!read_single(s) || s.size() != 1) return false;
    ref = s[0];
    return true;
  }
  template <class T>
  bool read_single(vector<T> &ref) {
    for (auto &d: ref) {
      if (!read_single(d)) return false;
    }
    return true;
  }
  template <class T, class U>
  bool read_single(pair<T, U> &p) {
    return (read_single(p.first) && read_single(p.second));
  }
  template <size_t N = 0, typename T>
  void read_single_tuple(T &t) {
    if constexpr (N < std::tuple_size<T>::value) {
      auto &x = std::get<N>(t);
      read_single(x);
      read_single_tuple<N + 1>(t);
    }
  }
  template <class... T>
  bool read_single(tuple<T...> &tpl) {
    read_single_tuple(tpl);
    return true;
  }
  void read() {}
  template <class H, class... T>
  void read(H &h, T &... t) {
    bool f = read_single(h);
    assert(f);
    read(t...);
  }
  Scanner(FILE *fp) : fp(fp) {}
};

struct Printer {
  Printer(FILE *_fp) : fp(_fp) {}
  ~Printer() { flush(); }

  static constexpr size_t SIZE = 1 << 15;
  FILE *fp;
  char line[SIZE], small[50];
  size_t pos = 0;
  void flush() {
    fwrite(line, 1, pos, fp);
    pos = 0;
  }
  void write(const char val) {
    if (pos == SIZE) flush();
    line[pos++] = val;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  void write(T val) {
    if (pos > (1 << 15) - 50) flush();
    if (val == 0) {
      write('0');
      return;
    }
    if (val < 0) {
      write('-');
      val = -val; // todo min
    }
    size_t len = 0;
    while (val) {
      small[len++] = char(0x30 | (val % 10));
      val /= 10;
    }
    for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
    pos += len;
  }
  void write(const string s) {
    for (char c: s) write(c);
  }
  void write(const char *s) {
    size_t len = strlen(s);
    for (size_t i = 0; i < len; i++) write(s[i]);
  }
  void write(const double x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  void write(const long double x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  template <typename T,
            typename enable_if<has_write<T>::value>::type * = nullptr>
  inline void write(T x) {
    x.write();
  }
  template <class T>
  void write(const vector<T> val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  template <class T, class U>
  void write(const pair<T, U> val) {
    write(val.first);
    write(' ');
    write(val.second);
  }
  template <size_t N = 0, typename T>
  void write_tuple(const T t) {
    if constexpr (N < std::tuple_size<T>::value) {
      if constexpr (N > 0) { write(' '); }
      const auto x = std::get<N>(t);
      write(x);
      write_tuple<N + 1>(t);
    }
  }
  template <class... T>
  bool write(tuple<T...> tpl) {
    write_tuple(tpl);
    return true;
  }
  template <class T, size_t S>
  void write(const array<T, S> val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  void write(i128 val) {
    string s;
    bool negative = 0;
    if (val < 0) {
      negative = 1;
      val = -val;
    }
    while (val) {
      s += '0' + int(val % 10);
      val /= 10;
    }
    if (negative) s += "-";
    reverse(all(s));
    if (len(s) == 0) s = "0";
    write(s);
  }
};
Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);
void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  printer.write(head);
  if (sizeof...(Tail)) printer.write(' ');
  print(forward<Tail>(tail)...);
}

void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
  scanner.read(head);
  read(tail...);
}
} // namespace fastio
using fastio::print;
using fastio::flush;
using fastio::read;

#define INT(...)   \
  int __VA_ARGS__; \
  read(__VA_ARGS__)
#define LL(...)   \
  ll __VA_ARGS__; \
  read(__VA_ARGS__)
#define STR(...)      \
  string __VA_ARGS__; \
  read(__VA_ARGS__)
#define CHAR(...)   \
  char __VA_ARGS__; \
  read(__VA_ARGS__)
#define DBL(...)      \
  double __VA_ARGS__; \
  read(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 2 "/home/maspy/compro/library/ds/segtree/dual_segtree.hpp"

template <typename Monoid>
struct Dual_SegTree {
  using MA = Monoid;
  using A = typename MA::value_type;
  int n, log, size;
  vc<A> laz;

  Dual_SegTree() : Dual_SegTree(0) {}
  Dual_SegTree(int n) { build(n); }

  void build(int m) {
    n = m;
    log = 1;
    while ((1 << log) < n) ++log;
    size = 1 << log;
    laz.assign(size << 1, MA::unit());
  }

  A get(int p) {
    assert(0 <= p && p < n);
    p += size;
    for (int i = log; i >= 1; i--) push(p >> i);
    return laz[p];
  }

  vc<A> get_all() {
    FOR(i, size) push(i);
    return {laz.begin() + size, laz.begin() + size + n};
  }

  void apply(int l, int r, const A& a) {
    assert(0 <= l && l <= r && r <= n);
    if (l == r) return;
    l += size, r += size;
    if (!MA::commute) {
      for (int i = log; i >= 1; i--) {
        if (((l >> i) << i) != l) push(l >> i);
        if (((r >> i) << i) != r) push((r - 1) >> i);
      }
    }
    while (l < r) {
      if (l & 1) all_apply(l++, a);
      if (r & 1) all_apply(--r, a);
      l >>= 1, r >>= 1;
    }
  }

private:
  void push(int k) {
    if (laz[k] == MA::unit()) return;
    all_apply(2 * k, laz[k]), all_apply(2 * k + 1, laz[k]);
    laz[k] = MA::unit();
  }
  void all_apply(int k, A a) { laz[k] = MA::op(laz[k], a); }
};
#line 2 "/home/maspy/compro/library/alg/monoid/max.hpp"

template <class X>
struct Monoid_Max {
  using value_type = X;
  static constexpr X op(const X &x, const X &y) noexcept { return max(x, y); }
  static constexpr X unit() { return numeric_limits<X>::lowest(); }
  static constexpr bool commute = true;
};
#line 2 "/home/maspy/compro/library/alg/monoid/min.hpp"

template <class X>
struct Monoid_Min {
  using value_type = X;
  static constexpr X op(const X &x, const X &y) noexcept { return min(x, y); }
  static constexpr X unit() { return numeric_limits<X>::max(); }
  static constexpr bool commute = true;
};
#line 6 "main.cpp"

void solve() {
  LL(A, B, C);
  LL(M);
  if (M == 0) return print((A + 1) * (B + 1) * (C + 1));
  ll N = A + B + C + 2;
  vc<pi> AA, AB, AC, BB, BC, CC;
  vc<int> SA, SB, SC, AT, BT, CT;
  ll S = A + B + C, T = A + B + C + 1;

  auto get = [&](int v) -> pair<int, int> {
    if (v < A) return {0, v};
    if (v < A + B) return {1, v - A};
    return {2, v - A - B};
  };

  FOR(M) {
    LL(u, v);
    if (u > v) swap(u, v);
    --u, --v;
    if (u == S && v == T) return print(0);
    elif (v == T) {
      if (0 <= u && u < A) AT.eb(u);
      if (A <= u && u < A + B) BT.eb(u - A);
      if (A + B <= u && u < A + B + C) CT.eb(u - A - B);
    }
    elif (v == S) {
      if (0 <= u && u < A) SA.eb(u);
      if (A <= u && u < A + B) SB.eb(u - A);
      if (A + B <= u && u < A + B + C) SC.eb(u - A - B);
    }
    else {
      assert(u < A + B + C && v < A + B + C);
      auto [i, a] = get(u);
      auto [j, b] = get(v);
      if (i == 0 && j == 0) AA.eb(a, b);
      if (i == 0 && j == 1) AB.eb(a, b);
      if (i == 0 && j == 2) AC.eb(a, b);
      if (i == 1 && j == 1) BB.eb(a, b);
      if (i == 1 && j == 2) BC.eb(a, b);
      if (i == 2 && j == 2) CC.eb(a, b);
    }
  }
  // 禁止区間が [, ) になるように
  for (auto&& [x, y]: AA) ++x, ++y;
  for (auto&& [x, y]: BB) ++x, ++y;
  for (auto&& [x, y]: CC) ++x, ++y;
  for (auto&& [x, y]: AB) ++x, ++y;
  for (auto&& [x, y]: AC) ++x, ++y;
  for (auto&& [x, y]: BC) ++x, ++y;
  for (auto&& x: SA) ++x;
  for (auto&& x: SB) ++x;
  for (auto&& x: SC) ++x;
  for (auto&& x: AT) ++x;
  for (auto&& x: BT) ++x;
  for (auto&& x: CT) ++x;

  ++A, ++B, ++C;

  vc<int> NGA(A + 1), NGB(B + 1), NGC(C + 1);
  for (auto&& [x, y]: AA) { NGA[x] += 1, NGA[y] -= 1; }
  for (auto&& [x, y]: BB) { NGB[x] += 1, NGB[y] -= 1; }
  for (auto&& [x, y]: CC) { NGC[x] += 1, NGC[y] -= 1; }
  for (auto&& x: SA) { NGA[0] += 1, NGA[x] -= 1; }
  for (auto&& x: SB) { NGB[0] += 1, NGB[x] -= 1; }
  for (auto&& x: SC) { NGC[0] += 1, NGC[x] -= 1; }
  for (auto&& x: AT) { NGA[x] += 1; }
  for (auto&& x: BT) { NGB[x] += 1; }
  for (auto&& x: CT) { NGC[x] += 1; }
  NGA = cumsum<int>(NGA, 0);
  NGB = cumsum<int>(NGB, 0);
  NGC = cumsum<int>(NGC, 0);
  vc<int> XA, XB, XC;
  FOR(x, A) if (!NGA[x]) XA.eb(x);
  FOR(x, B) if (!NGB[x]) XB.eb(x);
  FOR(x, C) if (!NGC[x]) XC.eb(x);
  // AB, AC, BC しかいらない
  for (auto&& [x, y]: AB) x = LB(XA, x), y = LB(XB, y);
  for (auto&& [x, y]: AC) x = LB(XA, x), y = LB(XC, y);
  for (auto&& [x, y]: BC) x = LB(XB, x), y = LB(XC, y);
  A = len(XA), B = len(XB), C = len(XC);

  // まずは、AB の情報を収集して、長方形を列挙する
  Dual_SegTree<Monoid_Max<int>> segLO(A);
  Dual_SegTree<Monoid_Min<int>> segHI(A);
  segLO.apply(0, A, 0);
  segHI.apply(0, A, B);
  for (auto&& [x, y]: AB) {
    segHI.apply(0, x, y);
    segLO.apply(x, A, y);
  }
  vc<int> LO = segLO.get_all();
  vc<int> HI = segHI.get_all();

  // c ごとに、有効な領域は？
  Dual_SegTree<Monoid_Max<int>> CL(C);
  Dual_SegTree<Monoid_Min<int>> CR(C);
  Dual_SegTree<Monoid_Max<int>> CD(C);
  Dual_SegTree<Monoid_Min<int>> CU(C);
  CL.apply(0, C, 0);
  CR.apply(0, C, A);
  CD.apply(0, C, 0);
  CU.apply(0, C, B);
  for (auto&& [x, y]: AC) {
    CR.apply(0, y, x);
    CL.apply(y, C, x);
  }
  for (auto&& [x, y]: BC) {
    CU.apply(0, y, x);
    CD.apply(y, C, x);
  }

  auto calc_c = [&](int c) -> ll {
    ll L = CL.get(c), R = CR.get(c);
    ll D = CD.get(c), U = CU.get(c);
    if (L >= R || D >= U) return 0;
    ll res = 0;
    FOR(x, L, R) {
      ll lo = LO[x], hi = HI[x];
      chmax(lo, D);
      chmin(hi, U);
      res += max<int>(0, hi - lo);
    }
    return res;
  };

  ll ANS = 0;
  FOR(c, C) ANS += calc_c(c);
  print(ANS);
}

signed main() {
  int T = 1;
  // INT(T);
  FOR(T) solve();
  return 0;
}
0