結果
問題 | No.2999 Long Long Friedrice |
ユーザー | 遭難者 |
提出日時 | 2024-12-16 10:33:33 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,024 bytes |
コンパイル時間 | 684 ms |
コンパイル使用メモリ | 82,804 KB |
実行使用メモリ | 86,784 KB |
最終ジャッジ日時 | 2024-12-23 23:30:55 |
合計ジャッジ時間 | 5,855 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
77,056 KB |
testcase_01 | AC | 93 ms
77,056 KB |
testcase_02 | AC | 92 ms
77,184 KB |
testcase_03 | AC | 100 ms
81,024 KB |
testcase_04 | AC | 120 ms
85,888 KB |
testcase_05 | AC | 103 ms
81,280 KB |
testcase_06 | AC | 102 ms
81,792 KB |
testcase_07 | AC | 137 ms
86,784 KB |
testcase_08 | AC | 106 ms
82,816 KB |
testcase_09 | AC | 107 ms
83,328 KB |
testcase_10 | AC | 99 ms
78,464 KB |
testcase_11 | AC | 95 ms
77,440 KB |
testcase_12 | AC | 98 ms
78,208 KB |
testcase_13 | WA | - |
testcase_14 | AC | 97 ms
79,488 KB |
testcase_15 | AC | 95 ms
78,208 KB |
testcase_16 | AC | 98 ms
78,336 KB |
testcase_17 | AC | 101 ms
80,640 KB |
testcase_18 | AC | 92 ms
77,568 KB |
testcase_19 | AC | 94 ms
76,928 KB |
testcase_20 | AC | 93 ms
77,184 KB |
testcase_21 | AC | 95 ms
77,824 KB |
testcase_22 | AC | 92 ms
77,056 KB |
testcase_23 | AC | 94 ms
77,568 KB |
testcase_24 | AC | 94 ms
77,184 KB |
testcase_25 | AC | 95 ms
77,184 KB |
testcase_26 | AC | 92 ms
77,568 KB |
testcase_27 | AC | 92 ms
77,568 KB |
testcase_28 | AC | 95 ms
77,184 KB |
testcase_29 | AC | 94 ms
77,568 KB |
testcase_30 | AC | 91 ms
77,440 KB |
testcase_31 | AC | 93 ms
77,440 KB |
testcase_32 | AC | 96 ms
77,312 KB |
testcase_33 | AC | 95 ms
77,184 KB |
testcase_34 | AC | 95 ms
77,056 KB |
testcase_35 | AC | 95 ms
77,056 KB |
testcase_36 | AC | 94 ms
77,184 KB |
testcase_37 | AC | 93 ms
77,184 KB |
testcase_38 | AC | 96 ms
77,568 KB |
ソースコード
import typing class DSU: ''' Implement (union by size) + (path halving) Reference: Zvi Galil and Giuseppe F. Italiano, Data structures and algorithms for disjoint set union problems ''' def __init__(self, n: int = 0) -> None: self._n = n self.parent_or_size = [-1] * n def merge(self, a: int, b: int) -> int: assert 0 <= a < self._n assert 0 <= b < self._n x = self.leader(a) y = 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: int, b: int) -> bool: assert 0 <= a < self._n assert 0 <= b < self._n return self.leader(a) == self.leader(b) def leader(self, a: int) -> int: assert 0 <= a < self._n parent = self.parent_or_size[a] while parent >= 0: if self.parent_or_size[parent] < 0: return parent self.parent_or_size[a], a, parent = ( self.parent_or_size[parent], self.parent_or_size[parent], self.parent_or_size[self.parent_or_size[parent]] ) return a def size(self, a: int) -> int: assert 0 <= a < self._n return -self.parent_or_size[self.leader(a)] def groups(self) -> typing.List[typing.List[int]]: leader_buf = [self.leader(i) for i in range(self._n)] result: typing.List[typing.List[int]] = [[] for _ in range(self._n)] for i in range(self._n): result[leader_buf[i]].append(i) return list(filter(lambda r: r, result)) n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) inf = 10**6 d = DSU(inf + 1) for i in range(n): d.merge(a[i], a[i] + b[i]) ans = 0 for i in range(inf + 1): if d.same(1, i): ans = i print(ans)