結果
問題 | No.1767 BLUE to RED |
ユーザー | Navier_Boltzmann |
提出日時 | 2021-11-27 18:14:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,336 ms / 2,000 ms |
コード長 | 1,551 bytes |
コンパイル時間 | 1,317 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 176,396 KB |
最終ジャッジ日時 | 2023-09-12 21:36:34 |
合計ジャッジ時間 | 20,616 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,296 KB |
testcase_01 | AC | 74 ms
71,088 KB |
testcase_02 | AC | 73 ms
71,276 KB |
testcase_03 | AC | 72 ms
71,136 KB |
testcase_04 | AC | 82 ms
75,492 KB |
testcase_05 | AC | 81 ms
75,348 KB |
testcase_06 | AC | 75 ms
71,388 KB |
testcase_07 | AC | 108 ms
76,884 KB |
testcase_08 | AC | 105 ms
77,240 KB |
testcase_09 | AC | 787 ms
123,724 KB |
testcase_10 | AC | 993 ms
137,828 KB |
testcase_11 | AC | 863 ms
129,640 KB |
testcase_12 | AC | 804 ms
123,708 KB |
testcase_13 | AC | 1,078 ms
163,320 KB |
testcase_14 | AC | 1,316 ms
176,328 KB |
testcase_15 | AC | 1,333 ms
176,148 KB |
testcase_16 | AC | 1,329 ms
173,152 KB |
testcase_17 | AC | 1,318 ms
173,152 KB |
testcase_18 | AC | 1,336 ms
173,348 KB |
testcase_19 | AC | 1,309 ms
176,316 KB |
testcase_20 | AC | 1,335 ms
173,392 KB |
testcase_21 | AC | 1,333 ms
173,332 KB |
testcase_22 | AC | 1,318 ms
172,808 KB |
testcase_23 | AC | 1,318 ms
176,396 KB |
ソースコード
N,M = map(int,input().split()) A = list(map(int,input().split())) B = list(map(int,input().split())) class DSU: def __init__(self, n): self._n = n self.parent_or_size = [-1] * 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] self.parent_or_size[y] = x return x 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 != []] X = A+B X.sort() SA = set(A) ans = 0 d = DSU(N+M+1) for i in range(N+M): if X[i] in SA: d.merge(i,N+M) edges = [(X[i+1]-X[i],i) for i in range(N+M-1)] edges.sort() for i in range(N+M-1): c,x = edges[i] if d.same(x,x+1): continue ans += c d.merge(x,x+1) print(ans)