結果
問題 | No.2294 Union Path Query (Easy) |
ユーザー | 👑 Nachia |
提出日時 | 2023-05-05 22:26:26 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,282 ms / 4,000 ms |
コード長 | 3,570 bytes |
コンパイル時間 | 2,005 ms |
コンパイル使用メモリ | 94,912 KB |
実行使用メモリ | 153,408 KB |
最終ジャッジ日時 | 2023-08-15 05:00:15 |
合計ジャッジ時間 | 40,102 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,012 KB |
testcase_01 | AC | 1 ms
5,016 KB |
testcase_02 | AC | 2 ms
4,948 KB |
testcase_03 | AC | 903 ms
153,020 KB |
testcase_04 | AC | 625 ms
89,204 KB |
testcase_05 | AC | 564 ms
78,128 KB |
testcase_06 | AC | 925 ms
153,260 KB |
testcase_07 | AC | 996 ms
153,196 KB |
testcase_08 | AC | 782 ms
153,104 KB |
testcase_09 | AC | 813 ms
153,208 KB |
testcase_10 | AC | 1,046 ms
153,096 KB |
testcase_11 | AC | 1,057 ms
153,204 KB |
testcase_12 | AC | 1,027 ms
153,088 KB |
testcase_13 | AC | 862 ms
153,208 KB |
testcase_14 | AC | 469 ms
153,300 KB |
testcase_15 | AC | 496 ms
153,176 KB |
testcase_16 | AC | 629 ms
153,408 KB |
testcase_17 | AC | 985 ms
153,300 KB |
testcase_18 | AC | 1,282 ms
153,204 KB |
testcase_19 | AC | 1,242 ms
153,208 KB |
testcase_20 | AC | 1,082 ms
153,164 KB |
testcase_21 | AC | 1,108 ms
153,208 KB |
testcase_22 | AC | 940 ms
153,092 KB |
testcase_23 | AC | 842 ms
153,016 KB |
testcase_24 | AC | 833 ms
153,104 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 2 ms
4,384 KB |
testcase_27 | AC | 2 ms
4,380 KB |
testcase_28 | AC | 146 ms
10,404 KB |
testcase_29 | AC | 191 ms
18,236 KB |
testcase_30 | AC | 237 ms
25,544 KB |
testcase_31 | AC | 295 ms
33,260 KB |
testcase_32 | AC | 363 ms
40,744 KB |
testcase_33 | AC | 434 ms
48,060 KB |
testcase_34 | AC | 463 ms
55,524 KB |
testcase_35 | AC | 489 ms
63,352 KB |
testcase_36 | AC | 530 ms
70,460 KB |
testcase_37 | AC | 585 ms
78,128 KB |
testcase_38 | AC | 611 ms
85,568 KB |
testcase_39 | AC | 652 ms
93,036 KB |
testcase_40 | AC | 760 ms
100,512 KB |
testcase_41 | AC | 707 ms
108,224 KB |
testcase_42 | AC | 741 ms
115,568 KB |
testcase_43 | AC | 770 ms
123,160 KB |
testcase_44 | AC | 807 ms
130,712 KB |
testcase_45 | AC | 843 ms
138,212 KB |
testcase_46 | AC | 870 ms
145,620 KB |
testcase_47 | AC | 879 ms
153,196 KB |
testcase_48 | AC | 454 ms
153,080 KB |
ソースコード
#include <vector> #include <algorithm> namespace nachia { struct Dsu{ private: int N; std::vector<int> P; std::vector<int> H; public: Dsu() : N(0) {} Dsu(int n) : N(n), P(n, -1), H(n) { for(int i=0; i<n; i++) H[i] = i; } int leader(int u){ if(P[u] < 0) return u; int v = P[u]; while(P[v] >= 0){ P[u] = P[v]; u = v; v = P[v]; } return P[u]; } int append(){ int n = P.size(); P.push_back(-1); H.push_back(n); return n; } int label(int u){ return H[leader(u)]; } int operator[](int u){ return H[leader(u)]; } void merge(int u, int v, int newLabel){ if(newLabel < 0) newLabel = u; u = leader(u); v = leader(v); if(u == v){ H[u] = newLabel; return; } N--; if(-P[u] < -P[v]) std::swap(u, v); P[u] += P[v]; H[P[v] = u] = newLabel; } int merge(int u, int v){ merge(u, v, u); return u; } int count(){ return N; } int size(int u){ return -P[leader(u)]; } bool same(int u, int v){ return leader(u) == leader(v); } }; } // namespace nachia #include <iostream> #include <string> #include <vector> #include <algorithm> #include <set> #include <atcoder/modint> using namespace std; using i32 = int; using u32 = unsigned int; using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(int i=0; i<(int)(n); i++) const i64 INF = 1001001001001001001; using Modint = atcoder::static_modint<998244353>; int main(){ long long N, X, Q; cin >> N >> X >> Q; auto dsu0 = vector<nachia::Dsu>(30, nachia::Dsu(N*2)); auto dsu = nachia::Dsu(N); vector<vector<pair<int,int>>> sum(N); rep(i,N) sum[i].assign(30, {1,0}); rep(i,Q){ int t; cin >> t; if(t == 1){ int v, w; cin >> v >> w; int dv = dsu[v]; int dX = dsu[X]; rep(d,30){ int val = (w >> d) & 1; if(!dsu0[d].same(v, dv)) val ^= 1; if(!dsu0[d].same(X, dX)) val ^= 1; if(val){ dsu0[d].merge(dv, dX + N); dsu0[d].merge(dv + N, dX); sum[dv][d].second += sum[dX][d].first; sum[dv][d].first += sum[dX][d].second; } else{ dsu0[d].merge(dv, dX); dsu0[d].merge(dv + N, dX + N); sum[dv][d].first += sum[dX][d].first; sum[dv][d].second += sum[dX][d].second; } } dsu.merge(v, X, dv); } if(t == 2){ int u, v; cin >> u >> v; if(!dsu.same(u, v)){ cout << "-1\n"; } else{ int ans = 0; rep(d,30) if(!dsu0[d].same(u, v)) ans += 1 << d; X = (X + ans) % N; cout << ans << '\n'; } } if(t == 3){ int v; cin >> v; v = dsu[v]; long long ans = 0; rep(d,30){ long long x = (long long)sum[v][d].first * sum[v][d].second % 998244353; ans += (x << d); ans %= 998244353; } cout << ans << '\n'; } if(t == 4){ long long v; cin >> v; X = (X + v) % N; } } return 0; } struct ios_do_not_sync{ ios_do_not_sync(){ ios::sync_with_stdio(false); cin.tie(nullptr); } } ios_do_not_sync_instance;