結果
問題 | No.2294 Union Path Query (Easy) |
ユーザー | t98slider |
提出日時 | 2023-03-16 19:49:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,525 ms / 4,000 ms |
コード長 | 1,815 bytes |
コンパイル時間 | 487 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 191,616 KB |
最終ジャッジ日時 | 2024-05-02 03:22:22 |
合計ジャッジ時間 | 49,894 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
52,480 KB |
testcase_01 | AC | 41 ms
52,480 KB |
testcase_02 | AC | 41 ms
52,352 KB |
testcase_03 | AC | 1,496 ms
178,052 KB |
testcase_04 | AC | 1,012 ms
139,776 KB |
testcase_05 | AC | 906 ms
128,896 KB |
testcase_06 | AC | 1,523 ms
187,904 KB |
testcase_07 | AC | 1,482 ms
177,260 KB |
testcase_08 | AC | 1,161 ms
191,616 KB |
testcase_09 | AC | 1,167 ms
184,960 KB |
testcase_10 | AC | 1,420 ms
188,160 KB |
testcase_11 | AC | 1,387 ms
177,204 KB |
testcase_12 | AC | 1,525 ms
180,172 KB |
testcase_13 | AC | 1,288 ms
189,952 KB |
testcase_14 | AC | 578 ms
176,488 KB |
testcase_15 | AC | 689 ms
176,620 KB |
testcase_16 | AC | 576 ms
177,284 KB |
testcase_17 | AC | 1,207 ms
175,348 KB |
testcase_18 | AC | 1,329 ms
178,300 KB |
testcase_19 | AC | 1,146 ms
179,448 KB |
testcase_20 | AC | 897 ms
176,892 KB |
testcase_21 | AC | 939 ms
177,272 KB |
testcase_22 | AC | 1,010 ms
177,056 KB |
testcase_23 | AC | 973 ms
176,048 KB |
testcase_24 | AC | 978 ms
176,296 KB |
testcase_25 | AC | 43 ms
52,480 KB |
testcase_26 | AC | 42 ms
52,096 KB |
testcase_27 | AC | 44 ms
52,608 KB |
testcase_28 | AC | 355 ms
83,380 KB |
testcase_29 | AC | 451 ms
88,104 KB |
testcase_30 | AC | 512 ms
93,172 KB |
testcase_31 | AC | 612 ms
98,844 KB |
testcase_32 | AC | 642 ms
103,376 KB |
testcase_33 | AC | 728 ms
108,528 KB |
testcase_34 | AC | 786 ms
113,552 KB |
testcase_35 | AC | 810 ms
118,592 KB |
testcase_36 | AC | 853 ms
123,280 KB |
testcase_37 | AC | 924 ms
128,944 KB |
testcase_38 | AC | 978 ms
133,568 KB |
testcase_39 | AC | 1,001 ms
139,144 KB |
testcase_40 | AC | 1,055 ms
142,784 KB |
testcase_41 | AC | 1,139 ms
149,136 KB |
testcase_42 | AC | 1,129 ms
152,924 KB |
testcase_43 | AC | 1,155 ms
157,404 KB |
testcase_44 | AC | 1,207 ms
163,336 KB |
testcase_45 | AC | 1,291 ms
168,624 KB |
testcase_46 | AC | 1,293 ms
172,852 KB |
testcase_47 | AC | 1,315 ms
178,072 KB |
testcase_48 | AC | 699 ms
176,356 KB |
ソースコード
from sys import stdin class UnionFind(): def __init__(self, n): self.parent_or_size = [-1] * n self.weight = [0] * n self.ans = [0] * n self.cnt = [[[0] * n for i in range(30)] for j in range(2)] for i in range(30): for j in range(n): self.cnt[0][i][j] = 1 def leader(self, x): if self.parent_or_size[x] < 0: return x root = self.leader(self.parent_or_size[x]) self.weight[x] ^= self.weight[self.parent_or_size[x]] self.parent_or_size[x] = root return root def merge(self, x, y, w): rx, ry = self.leader(x), self.leader(y) w ^= self.weight[x] ^ self.weight[y] if self.parent_or_size[rx] > self.parent_or_size[ry]: rx, ry = ry, rx self.parent_or_size[rx] += self.parent_or_size[ry] self.parent_or_size[ry] = rx self.weight[ry] = w self.ans[rx] = 0 for i in range(30): self.cnt[w >> i & 1][i][rx] += self.cnt[0][i][ry] self.cnt[1 ^ (w >> i & 1)][i][rx] += self.cnt[1][i][ry] self.ans[rx] += (self.cnt[0][i][rx] * self.cnt[1][i][rx] % 998244353) << i self.ans[rx] %= 998244353 def dist(self, x, y): if self.leader(x) != self.leader(y): return -1 return self.weight[x] ^ self.weight[y] N, X, Q = map(int, stdin.readline().split()) uf = UnionFind(N) for _ in range(Q): query = list(map(int, stdin.readline().split())) if query[0] == 1: uf.merge(X, query[1], query[2]) elif query[0] == 2: d = uf.dist(query[1], query[2]) print(d) if d != -1: X += d X %= N elif query[0] == 3: print(uf.ans[uf.leader(query[1])]) else: X += query[1] if X >= N: X -= N