結果
問題 | No.1293 2種類の道路 |
ユーザー | Navier_Boltzmann |
提出日時 | 2023-09-13 12:34:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 749 ms / 2,000 ms |
コード長 | 1,931 bytes |
コンパイル時間 | 968 ms |
コンパイル使用メモリ | 86,420 KB |
実行使用メモリ | 122,828 KB |
最終ジャッジ日時 | 2023-09-13 12:34:49 |
合計ジャッジ時間 | 11,755 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 110 ms
72,524 KB |
testcase_01 | AC | 105 ms
72,632 KB |
testcase_02 | AC | 107 ms
72,468 KB |
testcase_03 | AC | 105 ms
72,500 KB |
testcase_04 | AC | 107 ms
72,344 KB |
testcase_05 | AC | 105 ms
72,548 KB |
testcase_06 | AC | 107 ms
72,500 KB |
testcase_07 | AC | 122 ms
72,352 KB |
testcase_08 | AC | 112 ms
72,440 KB |
testcase_09 | AC | 724 ms
122,828 KB |
testcase_10 | AC | 732 ms
120,088 KB |
testcase_11 | AC | 697 ms
119,888 KB |
testcase_12 | AC | 749 ms
122,440 KB |
testcase_13 | AC | 740 ms
120,152 KB |
testcase_14 | AC | 502 ms
118,496 KB |
testcase_15 | AC | 478 ms
121,008 KB |
testcase_16 | AC | 403 ms
116,900 KB |
testcase_17 | AC | 401 ms
115,180 KB |
testcase_18 | AC | 365 ms
112,768 KB |
testcase_19 | AC | 515 ms
121,344 KB |
testcase_20 | AC | 535 ms
121,860 KB |
testcase_21 | AC | 211 ms
80,488 KB |
testcase_22 | AC | 193 ms
80,104 KB |
testcase_23 | AC | 193 ms
79,916 KB |
ソースコード
from collections import * from itertools import * from functools import * from heapq import * import sys,math input = sys.stdin.readline class DSU: def __init__(self, n): self._n = n self.parent_or_size = [-1] * n self.member = [[i] for i in range(n)] def merge(self, a, b): assert 0 <= a < self._n assert 0 <= b < self._n x, y = self.leader(a), self.leader(b) if x == y: return x if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x self.parent_or_size[x] += self.parent_or_size[y] for tmp in self.member[y]: self.member[x].append(tmp) self.parent_or_size[y] = x return x def members(self,a): return self.member[self.leader(a)] def same(self, a, b): assert 0 <= a < self._n assert 0 <= b < self._n return self.leader(a) == self.leader(b) def leader(self, a): assert 0 <= a < self._n if self.parent_or_size[a] < 0: return a self.parent_or_size[a] = self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self, a): assert 0 <= a < self._n return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf = [self.leader(i) for i in range(self._n)] result = [[] for _ in range(self._n)] for i in range(self._n): result[leader_buf[i]].append(i) return [r for r in result if r != []] N,D,W = map(int,input().split()) T = DSU(N) for _ in range(D): a,b = map(int,input().split()) a -= 1 b -= 1 T.merge(a,b) S = DSU(N) for _ in range(W): c,d = map(int,input().split()) c -= 1 d -= 1 S.merge(c,d) ans = 0 for gt in T.groups(): tt = set() for t in gt: tt.add(S.leader(t)) n = len(gt) s = sum(S.size(t) for t in tt) ans += n*s - n print(ans)