結果
問題 | No.2294 Union Path Query (Easy) |
ユーザー | 沙耶花 |
提出日時 | 2023-05-05 22:30:16 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 627 ms / 4,000 ms |
コード長 | 4,106 bytes |
コンパイル時間 | 5,284 ms |
コンパイル使用メモリ | 268,936 KB |
実行使用メモリ | 33,460 KB |
最終ジャッジ日時 | 2023-08-15 05:06:42 |
合計ジャッジ時間 | 34,773 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 488 ms
33,140 KB |
testcase_04 | AC | 544 ms
21,604 KB |
testcase_05 | AC | 557 ms
19,984 KB |
testcase_06 | AC | 474 ms
32,996 KB |
testcase_07 | AC | 449 ms
33,256 KB |
testcase_08 | AC | 543 ms
33,264 KB |
testcase_09 | AC | 540 ms
33,136 KB |
testcase_10 | AC | 488 ms
33,316 KB |
testcase_11 | AC | 488 ms
33,312 KB |
testcase_12 | AC | 481 ms
33,140 KB |
testcase_13 | AC | 552 ms
33,184 KB |
testcase_14 | AC | 523 ms
33,144 KB |
testcase_15 | AC | 408 ms
33,148 KB |
testcase_16 | AC | 620 ms
33,236 KB |
testcase_17 | AC | 257 ms
32,948 KB |
testcase_18 | AC | 314 ms
33,300 KB |
testcase_19 | AC | 402 ms
33,312 KB |
testcase_20 | AC | 470 ms
32,948 KB |
testcase_21 | AC | 472 ms
33,236 KB |
testcase_22 | AC | 427 ms
33,460 KB |
testcase_23 | AC | 408 ms
33,256 KB |
testcase_24 | AC | 403 ms
33,224 KB |
testcase_25 | AC | 2 ms
4,388 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,384 KB |
testcase_28 | AC | 625 ms
7,844 KB |
testcase_29 | AC | 617 ms
9,068 KB |
testcase_30 | AC | 627 ms
10,600 KB |
testcase_31 | AC | 616 ms
12,112 KB |
testcase_32 | AC | 602 ms
13,352 KB |
testcase_33 | AC | 609 ms
14,652 KB |
testcase_34 | AC | 597 ms
15,732 KB |
testcase_35 | AC | 588 ms
17,148 KB |
testcase_36 | AC | 585 ms
18,588 KB |
testcase_37 | AC | 580 ms
19,984 KB |
testcase_38 | AC | 574 ms
21,436 KB |
testcase_39 | AC | 581 ms
22,768 KB |
testcase_40 | AC | 566 ms
23,796 KB |
testcase_41 | AC | 564 ms
25,312 KB |
testcase_42 | AC | 561 ms
26,720 KB |
testcase_43 | AC | 558 ms
27,856 KB |
testcase_44 | AC | 553 ms
29,060 KB |
testcase_45 | AC | 545 ms
30,296 KB |
testcase_46 | AC | 542 ms
31,704 KB |
testcase_47 | AC | 541 ms
33,304 KB |
testcase_48 | AC | 367 ms
33,188 KB |
ソースコード
#include <stdio.h> #include <bits/stdc++.h> #include <atcoder/all> using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 4000000000000000001 template <class S> struct potentialized_dsu { public: potentialized_dsu() : _n(0) {} potentialized_dsu(int n) : _n(n), parent_or_size(n, -1), d(n) {} int merge(int a, int b, S v) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); int x = leader(a), y = leader(b); if (x == y) return x; if (-parent_or_size[x] < -parent_or_size[y]){ std::swap(x, y); std::swap(a, b); S t; v = t - v; } v += diff(x,a); v -= diff(y,b); d[y] += d[x] + v; parent_or_size[x] += parent_or_size[y]; parent_or_size[y] = x; return x; } bool same(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); return leader(a) == leader(b); } int leader(int a) { assert(0 <= a && a < _n); if (parent_or_size[a] < 0) return a; int l = leader(parent_or_size[a]); if(parent_or_size[a] != l){ d[a] += d[parent_or_size[a]]; parent_or_size[a] = l; } return parent_or_size[a]; } int size(int a) { assert(0 <= a && a < _n); return -parent_or_size[leader(a)]; } S diff(int a,int b){ assert(0 <= a && a < _n); assert(0 <= b && b < _n); leader(a); leader(b); return d[b] - d[a]; } std::vector<std::vector<int>> groups() { std::vector<int> leader_buf(_n), group_size(_n); for (int i = 0; i < _n; i++) { leader_buf[i] = leader(i); group_size[leader_buf[i]]++; } std::vector<std::vector<int>> result(_n); for (int i = 0; i < _n; i++) { result[i].reserve(group_size[i]); } for (int i = 0; i < _n; i++) { result[leader_buf[i]].push_back(i); } result.erase( std::remove_if(result.begin(), result.end(), [&](const std::vector<int>& v) { return v.empty(); }), result.end()); return result; } int _n; // root node: -1 * component size // otherwise: parent std::vector<int> parent_or_size; std::vector<S> d; }; struct xorint{ using mytype = xorint; int v = 0; mytype operator+(mytype another)const{ return (mytype(*this)+=another); } mytype &operator+=(const mytype &another){ (*this).v ^= another.v; return (*this); } mytype operator-(mytype another)const{ return (mytype(*this)-=another); } mytype &operator-=(const mytype &another){ (*this).v ^= another.v; return (*this); } }; int main(){ int n,x0,q; cin>>n>>x0>>q; potentialized_dsu<xorint> D(n); vector<int> t(q),a(q),b(q); int x= x0; rep(i,q){ cin>>t[i]; if(t[i]==1){ cin>>a[i]>>b[i]; xorint tx; tx.v = b[i]; D.merge(a[i],x,tx); } if(t[i]==2){ cin>>a[i]>>b[i]; if(D.same(a[i],b[i])){ x += D.diff(a[i],b[i]).v; x %= n; } } if(t[i]==3){ cin>>a[i]; } if(t[i]==4){ cin>>a[i]; x += a[i]; x %= n; } } //cout<<'a'<<endl; x = x0; dsu D2(n); vector<array<int,30>> A(n); vector<int> vs(n); rep(i,n){ int r = D.diff(i,D.leader(i)).v; vs[i] = r; array<int,30> ta; rep(j,30){ ta[j] = (r>>j)&1; } A[i] = ta; } rep(i,q){ if(t[i]==1){ int la = D2.leader(a[i]),lb = D2.leader(x); if(D2.same(la,lb))continue; D2.merge(la,lb); int lc = D2.leader(la); int ld = lc^la^lb; rep(j,30){ A[lc][j] += A[ld][j]; A[ld][j] = 0; } } if(t[i]==2){ if(D2.same(a[i],b[i])){ x += D.diff(a[i],b[i]).v; x %= n; cout<<D.diff(a[i],b[i]).v<<endl; } else{ cout<<-1<<endl; } } if(t[i]==3){ auto AA = A[D2.leader(a[i])]; mint ans =0; rep(j,30){ mint ttt = mint(2).pow(j); ttt *= AA[j]; ttt *= D2.size(a[i]) - AA[j]; ans += ttt; } cout<<ans.val()<<endl; } if(t[i]==4){ x += a[i]; x %= n; } } return 0; }