結果
問題 | No.1983 [Cherry 4th Tune C] 南の島のマーメイド |
ユーザー | mkawa2 |
提出日時 | 2023-11-11 18:45:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,004 ms / 4,000 ms |
コード長 | 3,405 bytes |
コンパイル時間 | 350 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 152,388 KB |
最終ジャッジ日時 | 2023-11-11 18:46:28 |
合計ジャッジ時間 | 26,403 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,460 KB |
testcase_01 | AC | 37 ms
53,460 KB |
testcase_02 | AC | 36 ms
53,460 KB |
testcase_03 | AC | 37 ms
53,460 KB |
testcase_04 | AC | 37 ms
53,460 KB |
testcase_05 | AC | 37 ms
53,460 KB |
testcase_06 | AC | 38 ms
53,460 KB |
testcase_07 | AC | 37 ms
53,460 KB |
testcase_08 | AC | 149 ms
77,492 KB |
testcase_09 | AC | 153 ms
78,600 KB |
testcase_10 | AC | 226 ms
80,324 KB |
testcase_11 | AC | 223 ms
80,384 KB |
testcase_12 | AC | 185 ms
78,980 KB |
testcase_13 | AC | 622 ms
105,076 KB |
testcase_14 | AC | 612 ms
106,548 KB |
testcase_15 | AC | 649 ms
120,644 KB |
testcase_16 | AC | 319 ms
105,456 KB |
testcase_17 | AC | 657 ms
108,728 KB |
testcase_18 | AC | 550 ms
119,908 KB |
testcase_19 | AC | 794 ms
127,316 KB |
testcase_20 | AC | 566 ms
118,152 KB |
testcase_21 | AC | 715 ms
114,648 KB |
testcase_22 | AC | 749 ms
119,204 KB |
testcase_23 | AC | 933 ms
128,732 KB |
testcase_24 | AC | 936 ms
130,792 KB |
testcase_25 | AC | 890 ms
128,444 KB |
testcase_26 | AC | 872 ms
128,356 KB |
testcase_27 | AC | 846 ms
128,640 KB |
testcase_28 | AC | 903 ms
128,588 KB |
testcase_29 | AC | 1,004 ms
129,340 KB |
testcase_30 | AC | 900 ms
128,800 KB |
testcase_31 | AC | 865 ms
128,348 KB |
testcase_32 | AC | 910 ms
128,836 KB |
testcase_33 | AC | 38 ms
53,460 KB |
testcase_34 | AC | 223 ms
101,828 KB |
testcase_35 | AC | 460 ms
151,432 KB |
testcase_36 | AC | 400 ms
119,596 KB |
testcase_37 | AC | 37 ms
53,460 KB |
testcase_38 | AC | 217 ms
77,232 KB |
testcase_39 | AC | 489 ms
151,048 KB |
testcase_40 | AC | 454 ms
152,388 KB |
ソースコード
import sys # sys.setrecursionlimit(1000005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 63) # md = 10**9+7 md = 998244353 class UnionFind: def __init__(self, n): self._tree = [-1]*n # number of connected component self.cnt = n def root(self, u): stack = [] while self._tree[u] >= 0: stack.append(u) u = self._tree[u] for v in stack: self._tree[v] = u return u def same(self, u, v): return self.root(u) == self.root(v) def merge(self, u, v): u, v = self.root(u), self.root(v) if u == v: return False if self._tree[u] > self._tree[v]: u, v = v, u self._tree[u] += self._tree[v] self._tree[v] = u self.cnt -= 1 return True # size of connected component def size(self, u): return -self._tree[self.root(u)] class LCA: def __init__(self, parents, depth): n = len(parents) self._depth = depth log = max(self._depth).bit_length() self._table = [parents]+[[-1]*n for _ in range(log)] row0 = self._table[0] for lv in range(log): row1 = self._table[lv+1] for u in range(n): if row0[u] == -1: continue row1[u] = row0[row0[u]] row0 = row1 def anc(self, u, v): diff = self._depth[u]-self._depth[v] if diff < 0: u, v = v, u diff = abs(diff) u = self.up(u, diff) if u == v: return u for lv in range(self._depth[u].bit_length()-1, -1, -1): anclv = self._table[lv] if anclv[u] != anclv[v]: u, v = anclv[u], anclv[v] return self._table[0][u] def up(self, u, dist): lv = 0 while dist and u != -1: if dist & 1: u = self._table[lv][u] lv, dist = lv+1, dist >> 1 return u n,m,q=LI() to=[[] for _ in range(n)] uv=[] uf=UnionFind(n) for _ in range(m): u,v=LI1() if uf.merge(u,v): to[u].append(v) to[v].append(u) else: uv.append((u,v)) def dfs(root=0): uu, stack = [], [root] while stack: u = stack.pop() uu.append(u) for v in to[u]: if v == parent[u]: continue parent[v] = u depth[v] = depth[u]+1 stack.append(v) return uu parent, depth = [-1]*n, [0]*n uu=[] for u in range(n): if parent[u]==-1:uu+=dfs(u) lca=LCA(parent,depth) dp=[0]*n for u,v in uv: a=lca.anc(u,v) dp[u]+=1 dp[v]+=1 dp[a]-=2 uf=UnionFind(n) for u in uu[::-1]: p=parent[u] if p==-1:continue dp[p]+=dp[u] if dp[u]:continue uf.merge(p,u) for _ in range(q): u,v=LI1() print("Yes" if uf.same(u,v) else "No")