結果
問題 | No.1983 [Cherry 4th Tune C] 南の島のマーメイド |
ユーザー | strangerxxx |
提出日時 | 2022-08-30 12:24:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,942 ms / 4,000 ms |
コード長 | 4,067 bytes |
コンパイル時間 | 552 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 190,892 KB |
最終ジャッジ日時 | 2024-11-07 07:38:25 |
合計ジャッジ時間 | 40,776 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
54,784 KB |
testcase_01 | AC | 49 ms
54,656 KB |
testcase_02 | AC | 55 ms
54,784 KB |
testcase_03 | AC | 48 ms
54,912 KB |
testcase_04 | AC | 48 ms
54,656 KB |
testcase_05 | AC | 48 ms
54,912 KB |
testcase_06 | AC | 48 ms
54,528 KB |
testcase_07 | AC | 51 ms
54,400 KB |
testcase_08 | AC | 246 ms
79,708 KB |
testcase_09 | AC | 278 ms
80,624 KB |
testcase_10 | AC | 278 ms
82,680 KB |
testcase_11 | AC | 306 ms
82,668 KB |
testcase_12 | AC | 305 ms
80,908 KB |
testcase_13 | AC | 1,119 ms
117,444 KB |
testcase_14 | AC | 1,208 ms
126,488 KB |
testcase_15 | AC | 1,249 ms
121,332 KB |
testcase_16 | AC | 828 ms
118,844 KB |
testcase_17 | AC | 1,228 ms
128,944 KB |
testcase_18 | AC | 1,065 ms
118,188 KB |
testcase_19 | AC | 1,388 ms
154,008 KB |
testcase_20 | AC | 1,100 ms
118,588 KB |
testcase_21 | AC | 1,236 ms
135,784 KB |
testcase_22 | AC | 1,394 ms
142,276 KB |
testcase_23 | AC | 1,942 ms
162,356 KB |
testcase_24 | AC | 1,691 ms
160,212 KB |
testcase_25 | AC | 1,745 ms
161,412 KB |
testcase_26 | AC | 1,682 ms
159,828 KB |
testcase_27 | AC | 1,723 ms
160,952 KB |
testcase_28 | AC | 1,703 ms
161,488 KB |
testcase_29 | AC | 1,749 ms
161,216 KB |
testcase_30 | AC | 1,683 ms
159,292 KB |
testcase_31 | AC | 1,707 ms
161,912 KB |
testcase_32 | AC | 1,715 ms
160,856 KB |
testcase_33 | AC | 49 ms
54,656 KB |
testcase_34 | AC | 760 ms
130,532 KB |
testcase_35 | AC | 931 ms
163,516 KB |
testcase_36 | AC | 908 ms
112,532 KB |
testcase_37 | AC | 49 ms
54,528 KB |
testcase_38 | AC | 570 ms
77,568 KB |
testcase_39 | AC | 1,038 ms
181,824 KB |
testcase_40 | AC | 1,036 ms
190,892 KB |
ソースコード
def resolve(): n, m, q = map(int, input().split()) edges = [[] for _ in range(n)] uf = UnionFind(n) for _ in range(m): u, v = map(lambda x: int(x) - 1, input().split()) edges[u].append(v) edges[v].append(u) uf.union(u, v) u = UnionFind(n) for v in uf.all_group_members().values(): d = {j: i for i, j in enumerate(v)} edge = [[] for _ in range(len(v))] for i, j in enumerate(v): for k in edges[j]: edge[i].append(d[k]) bridge = bridge_detection(edge) for i, j in bridge: u.union(v[i], v[j]) for _ in range(q): x, y = map(lambda x: int(x) - 1, input().split()) if u.same(x, y): print("Yes") else: print("No") def bridge_detection(edges, start=0): n = len(edges) ord = [-1] * n order = ord[:] low = ord[:] q = [(start, -1)] cnt = 0 edge = [[] for _ in range(n)] while q: i, pos = q.pop() if ord[i] >= 0: edge[i].append(pos) continue if pos >= 0: edge[pos].append(i) ord[i] = cnt order[cnt] = i cnt += 1 for j in reversed(edges[i]): if j == pos or ord[j] >= 0: continue q.append((j, i)) for i, j in enumerate(reversed(order)): low[j] = n - i - 1 for k in edge[j]: if ord[k] < low[j]: low[j] = ord[k] if low[k] >= 0 and low[k] < low[j]: low[j] = low[k] bridges = [] for i, j in enumerate(edge): for k in j: if ord[i] < low[k]: bridges.append((i, k)) return bridges class UnionFind: def __init__(self, n: int) -> None: self.n = n self.parent = [-1] * n self.groups = n def find(self, x: int) -> int: if self.parent[x] < 0: return x else: p = x while self.parent[p] >= 0: p = self.parent[p] while self.parent[x] >= 0: self.parent[x], x = p, self.parent[x] return p def union(self, x: int, y: int) -> bool: x = self.find(x) y = self.find(y) if x == y: return False if self.parent[x] > self.parent[y]: x, y = y, x self.parent[x] += self.parent[y] self.parent[y] = x self.groups -= 1 return True def union_right(self, x: int, y: int) -> bool: x = self.find(x) y = self.find(y) if x == y: return False if y > x: x, y = y, x self.parent[x] += self.parent[y] self.parent[y] = x self.groups -= 1 return True def union_left(self, x: int, y: int) -> bool: x = self.find(x) y = self.find(y) if x == y: return False if x > y: x, y = y, x self.parent[x] += self.parent[y] self.parent[y] = x self.groups -= 1 return True def size(self, x: int) -> int: return -self.parent[self.find(x)] def same(self, x: int, y: int) -> bool: return self.find(x) == self.find(y) def members(self, x: int) -> list: root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self) -> list: return [i for i, x in enumerate(self.parent) if x < 0] def group_count(self) -> int: return self.groups def sizes(self) -> dict: return {i: -x for i, x in enumerate(self.parent) if x < 0} def all_group_members(self) -> dict: from collections import defaultdict d = defaultdict(list) for i in range(self.n): p = self.find(i) d[p].append(i) return d def __str__(self) -> str: return '\n'.join('{}: {}'.format(k, v) for k, v in self.all_group_members().items()) if __name__ == '__main__': resolve()