結果
問題 | No.812 Change of Class |
ユーザー | kurimupy |
提出日時 | 2020-06-15 22:53:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,753 ms / 4,000 ms |
コード長 | 2,255 bytes |
コンパイル時間 | 279 ms |
コンパイル使用メモリ | 87,292 KB |
実行使用メモリ | 146,724 KB |
最終ジャッジ日時 | 2023-09-16 10:40:34 |
合計ジャッジ時間 | 46,196 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 873 ms
136,688 KB |
testcase_01 | AC | 253 ms
83,568 KB |
testcase_02 | AC | 541 ms
109,264 KB |
testcase_03 | AC | 1,003 ms
146,724 KB |
testcase_04 | AC | 899 ms
141,560 KB |
testcase_05 | AC | 1,753 ms
131,676 KB |
testcase_06 | AC | 1,398 ms
116,360 KB |
testcase_07 | AC | 178 ms
93,964 KB |
testcase_08 | AC | 122 ms
78,644 KB |
testcase_09 | AC | 1,710 ms
135,028 KB |
testcase_10 | AC | 1,711 ms
136,228 KB |
testcase_11 | AC | 353 ms
112,704 KB |
testcase_12 | AC | 1,146 ms
130,960 KB |
testcase_13 | AC | 92 ms
71,996 KB |
testcase_14 | AC | 92 ms
71,808 KB |
testcase_15 | AC | 1,251 ms
116,120 KB |
testcase_16 | AC | 237 ms
80,316 KB |
testcase_17 | AC | 1,099 ms
116,508 KB |
testcase_18 | AC | 944 ms
108,368 KB |
testcase_19 | AC | 1,051 ms
113,020 KB |
testcase_20 | AC | 1,595 ms
133,944 KB |
testcase_21 | AC | 833 ms
108,320 KB |
testcase_22 | AC | 451 ms
93,480 KB |
testcase_23 | AC | 216 ms
80,432 KB |
testcase_24 | AC | 256 ms
81,140 KB |
testcase_25 | AC | 406 ms
88,164 KB |
testcase_26 | AC | 1,482 ms
126,940 KB |
testcase_27 | AC | 1,416 ms
118,848 KB |
testcase_28 | AC | 954 ms
113,280 KB |
testcase_29 | AC | 340 ms
83,412 KB |
testcase_30 | AC | 1,151 ms
118,368 KB |
testcase_31 | AC | 1,008 ms
111,828 KB |
testcase_32 | AC | 555 ms
96,220 KB |
testcase_33 | AC | 1,081 ms
123,592 KB |
testcase_34 | AC | 248 ms
80,828 KB |
testcase_35 | AC | 382 ms
88,520 KB |
testcase_36 | AC | 231 ms
80,792 KB |
testcase_37 | AC | 699 ms
100,384 KB |
testcase_38 | AC | 223 ms
98,212 KB |
testcase_39 | AC | 675 ms
102,768 KB |
testcase_40 | AC | 319 ms
82,148 KB |
testcase_41 | AC | 202 ms
98,816 KB |
testcase_42 | AC | 1,215 ms
120,424 KB |
testcase_43 | AC | 444 ms
106,124 KB |
testcase_44 | AC | 832 ms
110,184 KB |
testcase_45 | AC | 238 ms
80,776 KB |
testcase_46 | AC | 409 ms
104,324 KB |
testcase_47 | AC | 808 ms
110,364 KB |
testcase_48 | AC | 955 ms
114,360 KB |
testcase_49 | AC | 333 ms
84,020 KB |
testcase_50 | AC | 137 ms
78,760 KB |
testcase_51 | AC | 401 ms
92,156 KB |
testcase_52 | AC | 652 ms
106,496 KB |
testcase_53 | AC | 288 ms
81,712 KB |
testcase_54 | AC | 265 ms
81,232 KB |
testcase_55 | AC | 602 ms
123,528 KB |
testcase_56 | AC | 690 ms
132,136 KB |
testcase_57 | AC | 723 ms
134,668 KB |
testcase_58 | AC | 446 ms
107,752 KB |
testcase_59 | AC | 797 ms
144,560 KB |
testcase_60 | AC | 87 ms
71,920 KB |
testcase_61 | AC | 85 ms
71,960 KB |
testcase_62 | AC | 86 ms
71,788 KB |
ソースコード
#change of class from collections import deque import math class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * (n+1) def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n + 1) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): return {r: self.members(r) for r in self.roots()} def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) N, M = map(int, input().split()) graph = [[] for i in range(N+1)] Uni = UnionFind(N) for i in range(M): p, q = map(int, input().split()) graph[p].append(q) graph[q].append(p) Uni.union(p,q) Q = int(input()) que = [] for _ in range(Q): x = int(input()) que.append(x) for i in range(Q): s_node = que[i] visited = [False for i in range(N+1)] distance = [float("inf") for i in range(N+1)] d = deque() e = deque() d.append(s_node) distance[s_node] = 0 visited[s_node]=True while d: while d: x = d.popleft() for node in graph[x]: if visited[node] == False: visited[node] = True distance[node] = distance[x]+1 e.append(node) if e: d = e e = deque() ans = 0 for node in Uni.members(s_node): if node!=s_node: ans = max(ans, math.ceil(math.log2(distance[node]))) print(Uni.size(s_node)-1,ans)