結果
問題 | No.812 Change of Class |
ユーザー |
![]() |
提出日時 | 2020-06-15 22:53:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,594 ms / 4,000 ms |
コード長 | 2,255 bytes |
コンパイル時間 | 151 ms |
コンパイル使用メモリ | 82,464 KB |
実行使用メモリ | 146,008 KB |
最終ジャッジ日時 | 2024-07-03 11:39:15 |
合計ジャッジ時間 | 39,507 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 60 |
ソースコード
#change of classfrom collections import dequeimport mathclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * (n+1)def find(self, x):if self.parents[x] < 0:return xelse: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:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef 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] = 0visited[s_node]=Truewhile d:while d:x = d.popleft()for node in graph[x]:if visited[node] == False:visited[node] = Truedistance[node] = distance[x]+1e.append(node)if e:d = ee = deque()ans = 0for 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)