結果
問題 | No.2072 Anatomy |
ユーザー |
![]() |
提出日時 | 2022-09-19 00:03:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 667 ms / 2,000 ms |
コード長 | 2,151 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 82,264 KB |
実行使用メモリ | 114,068 KB |
最終ジャッジ日時 | 2024-12-22 01:53:53 |
合計ジャッジ時間 | 10,524 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 27 |
ソースコード
from collections import defaultdictclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef 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):#self.parentsに要素数を記録しているのでほぼO(1)でできるreturn -self.parents[self.find(x)]def same(self, x, y):return self.find(x) == self.find(y)def members(self, x):#o(N)かかって非常に遅いですroot = self.find(x)return [i for i in range(self.n) 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):group_members = defaultdict(list)for member in range(self.n):group_members[self.find(member)].append(member)return group_membersdef __str__(self):return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())from collections import dequeN,M = map(int,input().split())nxedge =[[] for _ in range(M)]uf = UnionFind(N)board = []memo = [-1] * Nfor _ in range(M):u,v = map(int,input().split())board.append((u-1,v-1))for i in reversed(range(M)):u,v = board[i]if uf.same(u,v):nxedge[i].append(memo[uf.find(u)])memo[uf.find(u)] = ielse:if memo[uf.find(u)] != -1:nxedge[i].append(memo[uf.find(u)])if memo[uf.find(v)] != -1:nxedge[i].append(memo[uf.find(v)])uf.union(u,v)memo[uf.find(u)] = idp = [1] * Mq = deque()q.append(0)while q:now = q.popleft()for nx in nxedge[now]:dp[nx] = dp[now] + 1q.append(nx)print(max(dp))