結果
問題 | No.1920 Territory |
ユーザー | Rubikun |
提出日時 | 2022-04-29 23:33:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 373 ms / 5,000 ms |
コード長 | 17,237 bytes |
コンパイル時間 | 2,731 ms |
コンパイル使用メモリ | 235,012 KB |
実行使用メモリ | 35,252 KB |
最終ジャッジ日時 | 2023-09-11 15:11:20 |
合計ジャッジ時間 | 12,080 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 11 ms
17,944 KB |
testcase_01 | AC | 11 ms
18,140 KB |
testcase_02 | AC | 11 ms
17,972 KB |
testcase_03 | AC | 17 ms
18,404 KB |
testcase_04 | AC | 16 ms
18,284 KB |
testcase_05 | AC | 16 ms
18,108 KB |
testcase_06 | AC | 18 ms
18,096 KB |
testcase_07 | AC | 17 ms
18,144 KB |
testcase_08 | AC | 16 ms
18,204 KB |
testcase_09 | AC | 16 ms
18,108 KB |
testcase_10 | AC | 16 ms
18,104 KB |
testcase_11 | AC | 15 ms
18,100 KB |
testcase_12 | AC | 15 ms
18,168 KB |
testcase_13 | AC | 368 ms
28,384 KB |
testcase_14 | AC | 365 ms
28,320 KB |
testcase_15 | AC | 368 ms
28,288 KB |
testcase_16 | AC | 373 ms
28,372 KB |
testcase_17 | AC | 368 ms
28,380 KB |
testcase_18 | AC | 331 ms
27,532 KB |
testcase_19 | AC | 331 ms
27,524 KB |
testcase_20 | AC | 336 ms
27,392 KB |
testcase_21 | AC | 338 ms
27,388 KB |
testcase_22 | AC | 332 ms
27,536 KB |
testcase_23 | AC | 182 ms
33,832 KB |
testcase_24 | AC | 246 ms
35,252 KB |
testcase_25 | AC | 114 ms
25,960 KB |
testcase_26 | AC | 117 ms
25,336 KB |
testcase_27 | AC | 113 ms
25,960 KB |
testcase_28 | AC | 113 ms
25,868 KB |
testcase_29 | AC | 316 ms
34,868 KB |
testcase_30 | AC | 311 ms
34,656 KB |
testcase_31 | AC | 315 ms
29,044 KB |
testcase_32 | AC | 314 ms
28,896 KB |
testcase_33 | AC | 202 ms
27,036 KB |
testcase_34 | AC | 184 ms
26,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; } #define all(x) (x).begin(),(x).end() #define fi first #define se second #define mp make_pair #define si(x) int(x.size()) const int mod=1000000007,MAX=200005,INF=1<<30; // BIT セグ木 遅延セグ木 のみ // from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9 // (based on AtCoder STL) #include <algorithm> #include <array> #ifdef _MSC_VER #include <intrin.h> #endif namespace atcoder { namespace internal { int ceil_pow2(int n) { int x = 0; while ((1U << x) < (unsigned int)(n)) x++; return x; } int bsf(unsigned int n) { #ifdef _MSC_VER unsigned long index; _BitScanForward(&index, n); return index; #else return __builtin_ctz(n); #endif } } // namespace internal } // namespace atcoder #include <cassert> #include <numeric> #include <type_traits> namespace atcoder { namespace internal { #ifndef _MSC_VER template <class T> using is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value || std::is_same<T, __int128>::value, std::true_type, std::false_type>::type; template <class T> using is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value || std::is_same<T, unsigned __int128>::value, std::true_type, std::false_type>::type; template <class T> using make_unsigned_int128 = typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>; template <class T> using is_integral = typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type; template <class T> using is_signed_int = typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) || is_signed_int128<T>::value, std::true_type, std::false_type>::type; template <class T> using is_unsigned_int = typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type; template <class T> using to_unsigned = typename std::conditional< is_signed_int128<T>::value, make_unsigned_int128<T>, typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>, std::common_type<T>>::type>::type; #else template <class T> using is_integral = typename std::is_integral<T>; template <class T> using is_signed_int = typename std::conditional<is_integral<T>::value && std::is_signed<T>::value, std::true_type, std::false_type>::type; template <class T> using is_unsigned_int = typename std::conditional<is_integral<T>::value && std::is_unsigned<T>::value, std::true_type, std::false_type>::type; template <class T> using to_unsigned = typename std::conditional<is_signed_int<T>::value, std::make_unsigned<T>, std::common_type<T>>::type; #endif template <class T> using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>; template <class T> using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>; template <class T> using to_unsigned_t = typename to_unsigned<T>::type; } // namespace internal } // namespace atcoder #include <cassert> #include <vector> namespace atcoder { template <class T> struct fenwick_tree { using U = internal::to_unsigned_t<T>; public: fenwick_tree() : _n(0) {} fenwick_tree(int n) : _n(n), data(n) {} void add(int p, T x) { assert(0 <= p && p < _n); p++; while (p <= _n) { data[p - 1] += U(x); p += p & -p; } } T sum(int l, int r) { assert(0 <= l && l <= r && r <= _n); return sum(r) - sum(l); } private: int _n; std::vector<U> data; U sum(int r) { U s = 0; while (r > 0) { s += data[r - 1]; r -= r & -r; } return s; } }; } // namespace atcoder #include <algorithm> #include <cassert> #include <iostream> #include <vector> namespace atcoder { template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()> struct lazy_segtree { public: lazy_segtree() : lazy_segtree(0) {} lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {} lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) { log = internal::ceil_pow2(_n); size = 1 << log; d = std::vector<S>(2 * size, e()); lz = std::vector<F>(size, id()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); return d[p]; } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); if (l == r) return e(); l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push(r >> i); } S sml = e(), smr = e(); while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } void apply(int p, F f) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = mapping(f, d[p]); for (int i = 1; i <= log; i++) update(p >> i); } void apply(int l, int r, F f) { assert(0 <= l && l <= r && r <= _n); if (l == r) return; l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } { int l2 = l, r2 = r; while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } l = l2; r = r2; } for (int i = 1; i <= log; i++) { if (((l >> i) << i) != l) update(l >> i); if (((r >> i) << i) != r) update((r - 1) >> i); } } template <bool (*g)(S)> int max_right(int l) { return max_right(l, [](S x) { return g(x); }); } template <class G> int max_right(int l, G g) { assert(0 <= l && l <= _n); assert(g(e())); if (l == _n) return _n; l += size; for (int i = log; i >= 1; i--) push(l >> i); S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!g(op(sm, d[l]))) { while (l < size) { push(l); l = (2 * l); if (g(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template <bool (*g)(S)> int min_left(int r) { return min_left(r, [](S x) { return g(x); }); } template <class G> int min_left(int r, G g) { assert(0 <= r && r <= _n); assert(g(e())); if (r == 0) return 0; r += size; for (int i = log; i >= 1; i--) push((r - 1) >> i); S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!g(op(d[r], sm))) { while (r < size) { push(r); r = (2 * r + 1); if (g(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector<S> d; std::vector<F> lz; void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } void all_apply(int k, F f) { d[k] = mapping(f, d[k]); if (k < size) lz[k] = composition(f, lz[k]); } void push(int k) { all_apply(2 * k, lz[k]); all_apply(2 * k + 1, lz[k]); lz[k] = id(); } }; } // namespace atcoder #include <algorithm> #include <cassert> #include <vector> namespace atcoder { template <class S, S (*op)(S, S), S (*e)()> struct segtree { public: segtree() : segtree(0) {} segtree(int n) : segtree(std::vector<S>(n, e())) {} segtree(const std::vector<S>& v) : _n(int(v.size())) { log = internal::ceil_pow2(_n); size = 1 << log; d = std::vector<S>(2 * size, e()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); return d[p + size]; } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); S sml = e(), smr = e(); l += size; r += size; while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } template <bool (*f)(S)> int max_right(int l) { return max_right(l, [](S x) { return f(x); }); } template <class F> int max_right(int l, F f) { assert(0 <= l && l <= _n); assert(f(e())); if (l == _n) return _n; l += size; S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!f(op(sm, d[l]))) { while (l < size) { l = (2 * l); if (f(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template <bool (*f)(S)> int min_left(int r) { return min_left(r, [](S x) { return f(x); }); } template <class F> int min_left(int r, F f) { assert(0 <= r && r <= _n); assert(f(e())); if (r == 0) return 0; r += size; S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!f(op(d[r], sm))) { while (r < size) { r = (2 * r + 1); if (f(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector<S> d; void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } }; } // namespace atcoder //Union Find struct UF{ int n; vector<int> par,size,edge; void init(int n_){ n=n_; par.assign(n,-1); size.assign(n,1); edge.assign(n,0); for(int i=0;i<n;i++){ par[i]=i; } } int root(int a){ if(par[a]==a) return a; else return par[a]=root(par[a]); } void unite(int a,int b){ edge[root(a)]++; if(root(a)!=root(b)){ size[root(a)]+=size[root(b)]; edge[root(a)]+=edge[root(b)]; par[root(b)]=root(a); } } bool check(int a,int b){ return root(a)==root(b); } }; vector<pair<int,int>> wh[MAX],st[MAX]; const int D=200000; int main(){ std::ifstream in("text.txt"); std::cin.rdbuf(in.rdbuf()); cin.tie(0); ios::sync_with_stdio(false); atcoder::fenwick_tree<int> fen(D+1); vector<int> use; int N,M;cin>>N>>M; ll v=0,e=0; for(int i=0;i<N;i++){ ll a,b,c;cin>>a>>b>>c; e+=c-b; v+=c-b+1; wh[b].push_back(mp(a,1)); wh[c+1].push_back(mp(a,-1)); use.push_back(a); } for(int i=0;i<M;i++){ ll a,b,c;cin>>a>>b>>c; e+=c-b; v+=c-b+1; st[a].push_back(mp(b,c)); use.push_back(D+a); } UF uf;uf.init(400001); set<int> SE; set<pair<int,int>> chk; for(int x=1;x<=D;x++){ for(auto a:wh[x]){ ll y=a.fi; if(a.se==1){ fen.add(y,1); SE.insert(y); auto r=SE.upper_bound(y); if(r!=SE.end()){ if(!uf.check(y,*r)) chk.insert(mp(y,*r)); } auto l=SE.lower_bound(y); if(l!=SE.begin()){ l--; if(!uf.check(*l,y)) chk.insert(mp(*l,y)); if(r!=SE.end()){ if(chk.count(mp(*l,*r))) chk.erase(mp(*l,*r)); } } }else{ fen.add(y,-1); SE.erase(y); auto r=SE.upper_bound(y); if(r!=SE.end()){ if(chk.count(mp(y,*r))) chk.erase(mp(y,*r)); } auto l=SE.lower_bound(y); if(l!=SE.begin()){ l--; if(chk.count(mp(*l,y))) chk.erase(mp(*l,y)); if(r!=SE.end()){ if(!uf.check(*l,*r)) chk.insert(mp(*l,*r)); } } } } //for(auto a:chk) cout<<a.fi<<" "<<a.se<<" "; //cout<<endl; for(auto a:st[x]){ v-=fen.sum(a.fi,a.se+1); auto it=chk.lower_bound(mp(a.fi,-1)); while(it!=chk.end()&&(*it).se<=a.se){ uf.unite(D+x,(*it).fi); uf.unite(D+x,(*it).se); it=chk.erase(it); } auto s=SE.lower_bound(a.fi); if(s!=SE.end()&&(*s)<=a.se) uf.unite(D+x,*s); } } set<int> ro; for(int a:use){ ro.insert(uf.root(a)); } int c=si(ro); //cout<<v<<" "<<e<<" "<<c<<endl; cout<<c-v+e<<endl; }