結果
| 問題 | No.1920 Territory |
| ユーザー |
 maspy
|
| 提出日時 | 2022-06-05 10:37:33 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 27,730 bytes |
| コンパイル時間 | 6,423 ms |
| コンパイル使用メモリ | 269,264 KB |
| 実行使用メモリ | 190,976 KB |
| 最終ジャッジ日時 | 2023-10-21 03:05:29 |
| 合計ジャッジ時間 | 56,490 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge9 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 49 ms
50,108 KB |
| testcase_01 | AC | 47 ms
50,120 KB |
| testcase_02 | AC | 48 ms
50,108 KB |
| testcase_03 | AC | 68 ms
55,936 KB |
| testcase_04 | AC | 67 ms
55,944 KB |
| testcase_05 | AC | 67 ms
55,948 KB |
| testcase_06 | AC | 67 ms
55,936 KB |
| testcase_07 | AC | 67 ms
55,940 KB |
| testcase_08 | AC | 66 ms
55,284 KB |
| testcase_09 | AC | 67 ms
55,288 KB |
| testcase_10 | AC | 66 ms
55,276 KB |
| testcase_11 | AC | 65 ms
55,284 KB |
| testcase_12 | AC | 67 ms
55,296 KB |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"
#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>
T SUM(vector<T> &A) {
T sum = T(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())
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, 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};
}
ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
if (check(x))
ok = x;
else
ng = x;
}
return ok;
}
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);
}
vi s_to_vi(const string &S, char first_char) {
vi A(S.size());
FOR(i, S.size()) { A[i] = S[i] - first_char; }
return A;
}
template <typename T>
vector<T> cumsum(vector<T> &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;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
// stable
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(A);
assert(len(I) == n);
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 detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail
template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;
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 <class T, is_modint_t<T> * = nullptr>
bool read_single(T &ref) {
long long val = 0;
bool f = read_single(val);
ref = T(val);
return f;
}
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 <class A, class B, class C>
bool read_single(tuple<A, B, C> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)));
}
template <class A, class B, class C, class D>
bool read_single(tuple<A, B, C, D> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)) && read_single(get<3>(p)));
}
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 << setprecision(15) << x;
string s = oss.str();
write(s);
}
void write(const long double &x) {
ostringstream oss;
oss << setprecision(15) << x;
string s = oss.str();
write(s);
}
template <class T, is_modint_t<T> * = nullptr>
void write(T &ref) {
write(ref.val);
}
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 <class A, class B, class C>
void write(const tuple<A, B, C> &val) {
auto &[a, b, c] = val;
write(a), write(' '), write(b), write(' '), write(c);
}
template <class A, class B, class C, class D>
void write(const tuple<A, B, C, D> &val) {
auto &[a, b, c, d] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
}
template <class A, class B, class C, class D, class E>
void write(const tuple<A, B, C, D, E> &val) {
auto &[a, b, c, d, e] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
}
template <class A, class B, class C, class D, class E, class F>
void write(const tuple<A, B, C, D, E, F> &val) {
auto &[a, b, c, d, e, f] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
}
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...);
}
#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/unionfind.hpp"
struct UnionFind {
int num;
int comp;
vc<int> size, par;
UnionFind(int n) : num(n), comp(n), size(n, 1), par(n) {
iota(par.begin(), par.end(), 0);
}
int find(int x) {
while (par[x] != x) {
par[x] = par[par[x]];
x = par[x];
}
return x;
}
int operator[](int x) { return find(x); }
bool merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y) { return false; }
comp--;
if (size[x] < size[y]) swap(x, y);
size[x] += size[y];
size[y] = 0;
par[y] = x;
return true;
}
vc<int> find_all() {
vc<int> A(num);
FOR(i, num) A[i] = find(i);
return A;
}
void reset(){
comp = num;
size.assign(num, 1);
iota(all(par), 0);
}
};
#line 1 "/home/maspy/compro/library/ds/intervals.hpp"
// https://codeforces.com/contest/1638/problem/E
// https://codeforces.com/contest/897/problem/E
// 持つ値のタイプ T、座標タイプ X
// コンストラクタでは T none_val を指定する
template <typename T = ll, typename X = ll>
struct Intervals {
static constexpr X LLIM = numeric_limits<X>::lowest();
static constexpr X RLIM = numeric_limits<X>::max();
const T none_val;
// none_val でない区間の個数と長さ合計
int total_num;
X total_len;
map<X, T> dat;
Intervals(T none_val) : none_val(none_val), total_num(0), total_len(0) {
dat[LLIM] = none_val;
dat[RLIM] = none_val;
}
tuple<X, X, T> get(X x) {
auto it = dat.upper_bound(x);
X r = (*it).fi;
auto [l, t] = *prev(it);
return {l, r, t};
}
template <typename ADD, typename RM>
void set(X L, X R, T t, ADD& add_f, RM& rm_f) {
if (L == R) return;
assert(L < R);
// 区間 [l, r) を t に変更する
// まずは、重なるか隣り合う区間を全列挙
vc<tuple<X, X, T>> tmp;
auto it = prev(dat.lower_bound(L));
while (1) {
auto [l, t] = *it;
if (R < l) break;
it = next(it);
X r = (*it).fi;
tmp.eb(l, r, t);
}
auto [lx, _, lt] = tmp[0];
auto [__, rx, rt] = tmp.back();
// とりあえず全部削除
for (auto&& [l, r, t]: tmp) {
dat.erase(l);
if (t == none_val) continue;
total_num--;
total_len -= r - l;
rm_f(l, r, t);
}
if (lt == t) chmin(L, lx);
if (rt == t) chmax(R, rx);
if (lx < L) {
// [lx, L)
dat[lx] = lt;
if (lt != none_val) {
total_num++;
total_len += L - lx;
add_f(lx, L, lt);
}
}
if (R < rx) {
// [R, rx)
dat[R] = rt;
if (rt != none_val) {
total_num++;
total_len += rx - R;
add_f(R, rx, rt);
}
}
// [L, R)
dat[L] = t;
if (t != none_val) {
total_num++;
total_len += R - L;
add_f(L, R, t);
}
}
void set(X L, X R, T t = 1) {
auto f = [&](X L, X R, T t) -> void {};
set(L, R, t, f, f);
}
void erase(X L, X R) {
auto f = [&](X L, X R, T t) -> void {};
set(L, R, none_val, f, f);
}
// L, R 内のデータ (l, r, t) を全部取得する
vc<tuple<X, X, T>> get(X L, X R) {
vc<tuple<X, X, T>> res;
auto it = prev(dat.lower_bound(L));
while (1) {
auto [l, t] = *it;
if (R <= l) break;
it = next(it);
X r = (*it).fi;
X l0 = max(l, L);
X r0 = min(r, R);
if (l0 < r0) res.eb(l0, r0, t);
}
return res;
}
vc<tuple<X, X, T>> get_all() {
return get(LLIM + 1, RLIM);
}
void debug() {
auto it = dat.begin();
print("Intervals");
print("total_num", total_num);
print("total_len", total_len);
while (1) {
auto [l, t] = *it;
++it;
if (it == dat.end()) break;
X r = (*it).fi;
print("l, r, t", l, r, t);
}
}
};
#line 2 "/home/maspy/compro/library/alg/group_add.hpp"
template <class X>
struct Group_Add {
using value_type = X;
static constexpr X op(const X &x, const X &y) noexcept { return x + y; }
static constexpr X inverse(const X &x) noexcept { return -x; }
static constexpr X power(const X &x, ll n) noexcept { return n * x; }
static constexpr X unit() { return X(0); }
static constexpr bool commute = true;
};
#line 3 "/home/maspy/compro/library/ds/fenwick.hpp"
template <typename AbelGroup>
struct FenwickTree {
using E = typename AbelGroup::value_type;
int n;
vector<E> dat;
E total;
FenwickTree() : FenwickTree(0) {}
FenwickTree(int n) : n(n), total(AbelGroup::unit()) {
assert(AbelGroup::commute);
dat.assign(n, AbelGroup::unit());
}
FenwickTree(vc<E> v) : n(len(v)), total(AbelGroup::unit()) {
assert(AbelGroup::commute);
FOR(i, n) total = AbelGroup::op(total, v[i]);
dat = v;
FOR3(i, 1, n + 1) {
int j = i + (i & -i);
if (j <= n) dat[j - 1] = AbelGroup::op(dat[i - 1], dat[j - 1]);
}
}
void reset(){
total = AbelGroup::unit();
dat.assign(n, AbelGroup::unit());
}
E sum(int k) {
E ret = AbelGroup::unit();
for (; k > 0; k -= k & -k) ret = AbelGroup::op(ret, dat[k - 1]);
return ret;
}
E sum(int L, int R) {
E pos = AbelGroup::unit();
while (L < R) {
pos = AbelGroup::op(pos, dat[R - 1]);
R -= R & -R;
}
E neg = AbelGroup::unit();
while (R < L) {
neg = AbelGroup::op(neg, dat[L - 1]);
L -= L & -L;
}
return AbelGroup::op(pos, AbelGroup::inverse(neg));
}
E sum_all() { return total; }
void add(int k, E x) {
total = AbelGroup::op(total, x);
for (++k; k <= n; k += k & -k) dat[k - 1] = AbelGroup::op(dat[k - 1], x);
}
template <class F>
int max_right(F& check) {
assert(check(E(0)));
ll i = 0;
E s = AbelGroup::unit();
int k = 1;
int N = len(dat) + 1;
while (2 * k < N) k *= 2;
while (k) {
if (i + k < N && check(AbelGroup::op(s, dat[i + k - 1]))) {
i += k;
s = AbelGroup::op(s, dat[i - 1]);
}
k >>= 1;
}
return i;
}
int find_kth(E k) {
auto check = [&](E x) -> bool { return x <= k; };
return max_right(check);
}
void debug() { print("fenwick", dat); }
};
#line 2 "/home/maspy/compro/library/graph/base.hpp"
template <typename T>
struct Edge {
int frm, to;
T cost;
int id;
};
template <typename T = int, bool directed = false>
struct Graph {
int N, M;
using cost_type = T;
using edge_type = Edge<T>;
vector<edge_type> edges;
vector<int> indptr;
vector<edge_type> csr_edges;
bool prepared;
class OutgoingEdges {
public:
OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}
const edge_type* begin() const {
if (l == r) { return 0; }
return &G->csr_edges[l];
}
const edge_type* end() const {
if (l == r) { return 0; }
return &G->csr_edges[r];
}
private:
int l, r;
const Graph* G;
};
bool is_prepared() { return prepared; }
constexpr bool is_directed() { return directed; }
Graph() : N(0), M(0), prepared(0) {}
Graph(int N) : N(N), M(0), prepared(0) {}
void add(int frm, int to, T cost = 1, int i = -1) {
assert(!prepared);
assert(0 <= frm && 0 <= to && to < N);
if (i == -1) i = M;
auto e = edge_type({frm, to, cost, i});
edges.eb(e);
++M;
}
// wt, off
void read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }
void read_graph(int M, bool wt = false, int off = 1) {
FOR(M) {
INT(a, b);
a -= off, b -= off;
if (!wt) {
add(a, b);
} else {
T c;
read(c);
add(a, b, c);
}
}
build();
}
void read_parent(int off = 1) {
FOR3(v, 1, N) {
INT(p);
p -= off;
add(p, v);
}
build();
}
void build() {
assert(!prepared);
prepared = true;
indptr.assign(N + 1, 0);
for (auto&& e: edges) {
indptr[e.frm + 1]++;
if (!directed) indptr[e.to + 1]++;
}
FOR(v, N) indptr[v + 1] += indptr[v];
auto counter = indptr;
csr_edges.resize(indptr.back() + 1);
for (auto&& e: edges) {
csr_edges[counter[e.frm]++] = e;
if (!directed)
csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});
}
}
OutgoingEdges operator[](int v) const {
assert(prepared);
return {this, indptr[v], indptr[v + 1]};
}
void debug() {
print("Graph");
if (!prepared) {
print("frm to cost id");
for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);
} else {
print("indptr", indptr);
print("frm to cost id");
FOR(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);
}
}
};
#line 2 "/home/maspy/compro/library/graph/degree.hpp"
template <typename Graph>
vector<int> degree(Graph& G) {
vector<int> deg(G.N);
for(auto&& e : G.edges) deg[e.frm]++, deg[e.to]++;
return deg;
}
template <typename Graph>
pair<vector<int>, vector<int>> degree_inout(Graph& G) {
vector<int> indeg(G.N), outdeg(G.N);
for (auto&& e: G.edges) { indeg[e.to]++, outdeg[e.frm]++; }
return {indeg, outdeg};
}
#line 3 "/home/maspy/compro/library/graph/toposort.hpp"
// DAG じゃなかったら空配列
// 辞書順最小もできる：O(NlogN) → abc223
template <typename Graph>
vc<int> toposort(Graph& G, bool lex_min = false) {
assert(G.is_prepared());
assert(G.is_directed());
auto [indeg, outdeg] = degree_inout(G);
if (!lex_min) {
vc<int> V;
ll N = G.N;
FOR(v, N) if (indeg[v] == 0) V.eb(v);
ll p = 0;
while (p < len(V)) {
auto v = V[p++];
for (auto&& e: G[v]) {
if (--indeg[e.to] == 0) V.eb(e.to);
}
}
if (len(V) < N) { V.clear(); }
return V;
} else {
pqg<int> que;
vc<int> V;
ll N = G.N;
FOR(v, N) if (indeg[v] == 0) que.push(v);
while (len(que)) {
auto v = que.top();
que.pop();
V.eb(v);
for (auto&& e: G[v]) {
if (--indeg[e.to] == 0) que.push(e.to);
}
}
if (len(V) < N) { V.clear(); }
return V;
}
}
// https://codeforces.com/contest/798/problem/E
// toposort の候補をひとつ出力する。チェックはしない。
// 陽にグラフを作らず、何らかのデータ構造で未訪問の行き先を探す想定。
// set_used(v)：v を使用済に変更する
// find_unused(v)：v の行き先を探す。なければ -1 を返すこと。
template <typename F1, typename F2>
vc<int> toposort(int N, F1 set_used, F2 find_unused) {
vc<int> V;
vc<bool> done(N);
auto dfs = [&](auto self, ll v) -> void {
set_used(v);
done[v] = 1;
while (1) {
int to = find_unused(v);
if (to == -1) break;
self(self, to);
}
V.eb(v);
};
FOR(v, N) if (!done[v]) dfs(dfs, v);
return V;
}
#line 8 "main.cpp"
void solve() {
LL(N, M);
using T = tuple<ll, ll, ll, ll>;
vc<T> dat(N + M);
FOR(i, N + M) {
LL(a, b, c);
if (i < N) {
dat[i] = {b, a, c, a};
} else {
dat[i] = {a, b, a, c};
}
}
N = N + M;
// 少し伸ばしておく
for (auto&& [a, b, c, d]: dat) {
if (a == c) {
a = 10 * a;
c = 10 * c;
b = 10 * b - 1;
d = 10 * d + 1;
}
if (b == d) {
a = 10 * a - 1;
b = 10 * b;
c = 10 * c + 1;
d = 10 * d;
}
}
// 座圧
ll H = 0, W = 0;
{
vi X, Y;
for (auto&& [a, b, c, d]: dat) {
X.eb(a);
Y.eb(b);
X.eb(c);
Y.eb(d);
}
UNIQUE(X);
UNIQUE(Y);
for (auto&& [a, b, c, d]: dat) {
a = LB(X, a);
b = LB(Y, b);
c = LB(X, c);
d = LB(Y, d);
}
H = len(X);
W = len(Y);
}
using P = pair<int, int>;
vvc<P> datX(H), datY(W);
for (auto&& [a, b, c, d]: dat) {
if (a == c) datX[a].eb(b, d);
}
for (auto&& [a, b, c, d]: dat) {
if (b == d) datY[b].eb(a, c);
}
auto shrink = [&](vc<P>& LR) -> void {
Intervals<int, int> I(0);
for (auto&& [l, r]: LR) { I.set(l, r, 1); }
LR.clear();
for (auto&& [l, r, x]: I.get_all()) {
if (x == 0) continue;
LR.eb(l, r);
}
};
FOR(x, H) shrink(datX[x]);
FOR(y, W) shrink(datY[y]);
ll V = 0, E = 0, C = 0;
{
ll n = 0;
FOR(x, H) n += len(datX[x]);
FOR(y, W) n += len(datY[y]);
V += 2 * n;
E += n;
}
// y を昇順に動かす。マッチする x を数える
{
ll cross = 0;
vvc<int> add_x(W), rm_x(W);
FOR(x, H) {
for (auto&& [a, b]: datX[x]) {
add_x[a].eb(x);
rm_x[b].eb(x);
}
}
FenwickTree<Group_Add<int>> bit(H);
FOR(y, W) {
for (auto&& x: add_x[y]) { bit.add(x, 1); }
for (auto&& x: rm_x[y]) { bit.add(x, -1); }
for (auto&& [l, r]: datY[y]) { cross += bit.sum(l, r); }
}
// print("cross", cross);
V += cross;
E += 2 * cross;
}
// とりあえず線分に番号を振る
vvc<int> IDX(H), IDY(W);
int nxt_idx = 0;
FOR(x, H) FOR(len(datX[x])) IDX[x].eb(nxt_idx++);
int ax = nxt_idx;
FOR(y, W) FOR(len(datY[y])) IDY[y].eb(nxt_idx++);
int ay = nxt_idx - ax;
if (ax > ay) {
swap(datX, datY);
swap(IDX, IDY);
swap(H, W);
}
const int buf = 2'000'000;
Graph<int, 1> G(buf);
auto add_edge = [&](int a, int b) -> void {
if (a == -1 || b == -1) return;
G.add(a, b);
};
N = nxt_idx;
// 永続セグ木 + 区間辺を張るテクを使う。
// セグ木の各ノードに入っている頂点番号
vc<int> seg(H + H, -1);
FOR(i, 1, H) seg[i] = nxt_idx++;
FOR(i, 2, H + H) { add_edge(seg[i / 2], seg[i]); }
vvc<pair<int, int>> add_x(W);
vvc<int> rm_x(W);
FOR(x, H) {
FOR(i, len(datX[x])) {
auto [y1, y2] = datX[x][i];
int idx = IDX[x][i];
add_x[y1].eb(x, idx);
rm_x[y2].eb(x);
}
}
auto upd = [&](int x, int new_idx) -> void {
// i をコピーノードに張り替え。それにともなって親も変えていく
int i = x + H;
seg[i] = new_idx;
while (i > 1) {
i /= 2;
seg[i] = nxt_idx++;
add_edge(seg[i], seg[2 * i + 0]);
add_edge(seg[i], seg[2 * i + 1]);
}
};
FOR(y, W) {
for (auto&& [x, idx]: add_x[y]) { upd(x, idx); }
for (auto&& x: rm_x[y]) { upd(x, -1); }
FOR(k, len(datY[y])) {
auto [l, r] = datY[y][k];
int idx = IDY[y][k];
l += H, r += H;
while (l < r) {
if (l & 1) add_edge(idx, seg[l++]);
if (r & 1) add_edge(idx, seg[--r]);
l /= 2, r /= 2;
}
}
}
G.build();
int n = nxt_idx;
UnionFind uf(n);
auto I = toposort(G);
assert(len(I) > 0);
vc<int> can(buf, 0);
FOR(x, H) for (auto&& idx: IDX[x]) { can[idx] = 2; }
FOR(y, W) for (auto&& idx: IDY[y]) { can[idx] = 1; }
// 1 から行ける
for (auto&& v: I) {
if (!(can[v] & 1)) continue;
for (auto&& e: G[v]) { can[e.to] |= 1; }
}
// 2 に行ける
reverse(all(I));
for (auto&& v: I) {
for (auto&& e: G[v]) {
if (can[e.to] & 2) can[v] |= 2;
}
}
// どっちにも行けるようなところをマージ
FOR(v, n) if (can[v] == 3) {
for (auto&& e: G[v]) {
if (can[e.to] == 3) { uf.merge(v, e.to); }
}
}
auto comp = uf.find_all();
comp.resize(N);
UNIQUE(comp);
C = len(comp);
print(E - V + C);
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(15);
ll T = 1;
// LL(T);
FOR(T) solve();
return 0;
}