#line 1 "/home/maspy/compro/library/my_template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using pi = pair; using vi = vector; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using vvvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; #define vec(type, name, ...) vector name(__VA_ARGS__) #define vv(type, name, h, ...) \ vector> name(h, vector(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector>> name( \ h, vector>(w, vector(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector>>> name( \ a, vector>>( \ b, vector>(c, vector(__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 T SUM(const vector &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 T pick(deque &que) { T a = que.front(); que.pop_front(); return a; } template T pick(pq &que) { T a = que.top(); que.pop(); return a; } template T pick(pqg &que) { assert(que.size()); T a = que.top(); que.pop(); return a; } template T pick(vc &que) { assert(que.size()); T a = que.back(); que.pop_back(); return a; } template T ceil(T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); } template T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); } template pair divmod(T x, U y) { T q = floor(x, y); return {q, x - q * y}; } template 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 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 inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vc s_to_vi(const string &S, char first_char) { vc A(S.size()); FOR(i, S.size()) { A[i] = S[i] - first_char; } return A; } template vector cumsum(vector &A, int off = 1) { int N = A.size(); vector B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } template vc bincount(const vc &A, int size) { vc C(size); for (auto &&x: A) { ++C[x]; } return C; } // stable template vector argsort(const vector &A) { vector 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 vc rearrange(const vc &A, const vc &I) { int n = len(I); vc 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 namespace fastio { // クラスが read(), print() を持っているかを判定するメタ関数 struct has_write_impl { template static auto check(T &&x) -> decltype(x.write(), std::true_type{}); template static auto check(...) -> std::false_type; }; template class has_write : public decltype(has_write_impl::check(std::declval())) { }; struct has_read_impl { template static auto check(T &&x) -> decltype(x.read(), std::true_type{}); template static auto check(...) -> std::false_type; }; template class has_read : public decltype(has_read_impl::check(std::declval())) {}; 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 ::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 ::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 ::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 bool read_single(vector &ref) { for (auto &d: ref) { if (!read_single(d)) return false; } return true; } template bool read_single(pair &p) { return (read_single(p.first) && read_single(p.second)); } template void read_single_tuple(T &t) { if constexpr (N < std::tuple_size::value) { auto &x = std::get(t); read_single(x); read_single_tuple(t); } } template bool read_single(tuple &tpl) { read_single_tuple(tpl); return true; } void read() {} template 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 ::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 ::value>::type * = nullptr> inline void write(T x) { x.write(); } template void write(const vector val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template void write(const pair val) { write(val.first); write(' '); write(val.second); } template void write_tuple(const T t) { if constexpr (N < std::tuple_size::value) { if constexpr (N > 0) { write(' '); } const auto x = std::get(t); write(x); write_tuple(t); } } template bool write(tuple tpl) { write_tuple(tpl); return true; } template void write(const array 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 void print(Head &&head, Tail &&... tail) { printer.write(head); if (sizeof...(Tail)) printer.write(' '); print(forward(tail)...); } void read() {} template 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 name(size); \ read(name) #define VV(type, name, h, w) \ vector> name(h, vector(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 struct Dual_SegTree { using MA = Monoid; using A = typename MA::value_type; int n, log, size; vc 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 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 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::lowest(); } static constexpr bool commute = true; }; #line 2 "/home/maspy/compro/library/alg/monoid/min.hpp" template 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::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 AA, AB, AC, BB, BC, CC; vc SA, SB, SC, AT, BT, CT; ll S = A + B + C, T = A + B + C + 1; auto get = [&](int v) -> pair { 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 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(NGA, 0); NGB = cumsum(NGB, 0); NGC = cumsum(NGC, 0); vc 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> segLO(A); Dual_SegTree> 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 LO = segLO.get_all(); vc HI = segHI.get_all(); // c ごとに、有効な領域は? Dual_SegTree> CL(C); Dual_SegTree> CR(C); Dual_SegTree> CD(C); Dual_SegTree> 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) FOR(y, D, U) { if (LO[x] <= y && y < HI[x]) ++res; } 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; }