結果
問題 | No.2072 Anatomy |
ユーザー |
![]() |
提出日時 | 2022-09-16 21:42:57 |
言語 | PyPy3 (7.3.8) |
結果 |
AC
|
実行時間 | 344 ms / 2,000 ms |
コード長 | 1,764 bytes |
コンパイル時間 | 276 ms |
使用メモリ | 110,684 KB |
最終ジャッジ日時 | 2023-01-11 06:22:38 |
合計ジャッジ時間 | 8,246 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
75,628 KB |
testcase_01 | AC | 72 ms
75,460 KB |
testcase_02 | AC | 75 ms
75,780 KB |
testcase_03 | AC | 74 ms
75,788 KB |
testcase_04 | AC | 73 ms
75,644 KB |
testcase_05 | AC | 73 ms
75,720 KB |
testcase_06 | AC | 72 ms
75,844 KB |
testcase_07 | AC | 74 ms
75,628 KB |
testcase_08 | AC | 331 ms
106,756 KB |
testcase_09 | AC | 266 ms
107,024 KB |
testcase_10 | AC | 320 ms
106,776 KB |
testcase_11 | AC | 291 ms
107,664 KB |
testcase_12 | AC | 260 ms
102,492 KB |
testcase_13 | AC | 329 ms
109,240 KB |
testcase_14 | AC | 274 ms
100,344 KB |
testcase_15 | AC | 215 ms
99,052 KB |
testcase_16 | AC | 328 ms
109,948 KB |
testcase_17 | AC | 270 ms
108,404 KB |
testcase_18 | AC | 200 ms
96,520 KB |
testcase_19 | AC | 344 ms
110,684 KB |
testcase_20 | AC | 344 ms
109,944 KB |
testcase_21 | AC | 226 ms
108,724 KB |
testcase_22 | AC | 328 ms
109,920 KB |
testcase_23 | AC | 254 ms
108,816 KB |
testcase_24 | AC | 214 ms
108,752 KB |
testcase_25 | AC | 332 ms
110,628 KB |
testcase_26 | AC | 71 ms
75,768 KB |
testcase_27 | AC | 249 ms
108,812 KB |
testcase_28 | AC | 255 ms
109,748 KB |
ソースコード
import sys sys.setrecursionlimit(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 << 63)-1 # inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 class UnionFind: def __init__(self, n): self.state = [-1]*n self.size_table = [1]*n self.w = [0]*n self.cnt = n def root(self, u): stack = [] while self.state[u] >= 0: stack.append(u) u = self.state[u] for v in stack: self.state[v] = u return u def same(self, u, v): return self.root(u) == self.root(v) def merge(self, u, v): u = self.root(u) v = self.root(v) if u == v: self.w[u] += 1 return False du = -self.state[u] dv = -self.state[v] if du < dv: u, v = v, u if du == dv: self.state[u] -= 1 self.w[u] = max(self.w[u], self.w[v])+1 self.state[v] = u self.cnt -= 1 self.size_table[u] += self.size_table[v] return True def size(self, u): return self.size_table[self.root(u)] n, m = LI() uv = LLI1(m) uf = UnionFind(n) for u, v in uv[::-1]: uf.merge(u, v) r = uf.root(0) print(uf.w[r])