結果
問題 | No.2296 Union Path Query (Hard) |
ユーザー | t98slider |
提出日時 | 2023-03-16 20:00:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,079 ms / 7,000 ms |
コード長 | 3,820 bytes |
コンパイル時間 | 398 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 186,596 KB |
最終ジャッジ日時 | 2024-05-02 14:17:12 |
合計ジャッジ時間 | 62,279 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
54,528 KB |
testcase_01 | AC | 91 ms
112,896 KB |
testcase_02 | AC | 90 ms
112,640 KB |
testcase_03 | AC | 93 ms
113,024 KB |
testcase_04 | AC | 1,527 ms
163,920 KB |
testcase_05 | AC | 1,642 ms
168,316 KB |
testcase_06 | AC | 1,911 ms
171,052 KB |
testcase_07 | AC | 1,171 ms
162,832 KB |
testcase_08 | AC | 1,138 ms
163,572 KB |
testcase_09 | AC | 1,062 ms
134,652 KB |
testcase_10 | AC | 1,080 ms
133,944 KB |
testcase_11 | AC | 1,169 ms
136,004 KB |
testcase_12 | AC | 1,144 ms
128,912 KB |
testcase_13 | AC | 525 ms
84,996 KB |
testcase_14 | AC | 442 ms
82,728 KB |
testcase_15 | AC | 2,079 ms
174,956 KB |
testcase_16 | AC | 1,746 ms
155,728 KB |
testcase_17 | AC | 1,088 ms
110,348 KB |
testcase_18 | AC | 1,754 ms
173,684 KB |
testcase_19 | AC | 1,293 ms
131,648 KB |
testcase_20 | AC | 1,976 ms
175,948 KB |
testcase_21 | AC | 1,721 ms
168,276 KB |
testcase_22 | AC | 1,719 ms
166,960 KB |
testcase_23 | AC | 507 ms
186,596 KB |
testcase_24 | AC | 407 ms
131,784 KB |
testcase_25 | AC | 942 ms
166,100 KB |
testcase_26 | AC | 940 ms
165,348 KB |
testcase_27 | AC | 1,540 ms
166,316 KB |
testcase_28 | AC | 1,565 ms
165,548 KB |
testcase_29 | AC | 1,671 ms
169,264 KB |
testcase_30 | AC | 1,692 ms
169,104 KB |
testcase_31 | AC | 1,678 ms
154,660 KB |
testcase_32 | AC | 1,765 ms
153,744 KB |
testcase_33 | AC | 1,791 ms
150,828 KB |
testcase_34 | AC | 1,457 ms
149,824 KB |
testcase_35 | AC | 1,139 ms
148,444 KB |
testcase_36 | AC | 913 ms
142,380 KB |
testcase_37 | AC | 1,636 ms
132,808 KB |
testcase_38 | AC | 1,693 ms
134,092 KB |
testcase_39 | AC | 1,660 ms
133,192 KB |
testcase_40 | AC | 1,637 ms
133,204 KB |
testcase_41 | AC | 42 ms
54,528 KB |
testcase_42 | AC | 40 ms
54,656 KB |
testcase_43 | AC | 45 ms
54,784 KB |
testcase_44 | AC | 926 ms
182,528 KB |
testcase_45 | AC | 930 ms
173,572 KB |
testcase_46 | AC | 992 ms
168,908 KB |
testcase_47 | AC | 1,201 ms
173,060 KB |
testcase_48 | AC | 1,113 ms
169,060 KB |
ソースコード
from sys import stdin from collections import deque class UnionFind(): def __init__(self, n): self.parent_or_size = [-1] * n self.G = [[] for i in range(n)] self.E = [[] for i in range(n)] self.depth = [0] * n self.dp = [0] * n self.log_table = [0] * n self.diameter = [0] * n self.diameter_vertex = [0] * (2 * n) self.parent = [[-1] * n for i in range(18)] self.que = deque() for i in range(n): self.diameter_vertex[i << 1] = i self.diameter_vertex[(i << 1) + 1] = i for i in range(2, n): self.log_table[i] = self.log_table[i >> 1] + 1 def leader(self, x): return x if self.parent_or_size[x] < 0 else self.parent_or_size[x] def merge(self, u, v, w): x, y = self.leader(u), self.leader(v) if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x u, v = v, u self.parent_or_size[x] += self.parent_or_size[y] self.G[u].append(v) self.G[v].append(u) self.E[v].append(w) self.E[u].append(w) self.update_parent(v, u, w) self.que.append(v) while len(self.que): v = self.que.popleft() self.parent_or_size[v] = x for i in range(len(self.G[v])): if self.G[v][i] == self.parent[0][v]: continue self.update_parent(self.G[v][i], v, self.E[v][i]) self.que.append(self.G[v][i]) self.update_diameter(x, y) def update_parent(self, v, par, w): logv = self.log_table[max(self.depth[v], self.depth[par] + 1)] self.depth[v] = self.depth[par] + 1 self.dp[v] = self.dp[par] + w self.parent[0][v] = par for i in range(logv): self.parent[i + 1][v] = -1 if self.parent[i][v] == -1 else self.parent[i][self.parent[i][v]] def update_diameter(self, x, y): mx, v, u = 0, 0, 0 v1, v2 = self.diameter_vertex[2 * x], self.diameter_vertex[2 * x + 1] v3, v4 = self.diameter_vertex[2 * y], self.diameter_vertex[2 * y + 1] if self.diameter[x] >= self.diameter[y]: mx, u, v = self.diameter[x], v1, v2 else: mx, u, v = self.diameter[y], v3, v4 d = self.dist(v1, v3) if d > mx: mx, u, v = d, v1, v3 d = self.dist(v1, v4) if d > mx: mx, u, v = d, v1, v4 d = self.dist(v2, v3) if d > mx: mx, u, v = d, v2, v3 d = self.dist(v2, v4) if d > mx: mx, u, v = d, v2, v4 self.diameter[x], self.diameter_vertex[2 * x], self.diameter_vertex[2 * x + 1] = mx, u, v def dist(self, u, v): if self.leader(u) != self.leader(v): return -1 if self.depth[u] > self.depth[v]: u, v = v, u res = self.dp[u] + self.dp[v] d = self.depth[v] - self.depth[u] while d: v = self.parent[self.log_table[d]][v] d -= 1 << self.log_table[d] if u == v: return res - 2 * self.dp[v] for i in range(self.log_table[self.depth[v]], -1,-1): if self.parent[i][v] != self.parent[i][u]: u = self.parent[i][u] v = self.parent[i][v] return res - 2 * self.dp[self.parent[0][v]] 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.diameter[uf.leader(query[1])]) else: X += query[1] if X >= N: X -= N