結果
問題 | No.1382 Travel in Mitaru city |
ユーザー | Mitarushi |
提出日時 | 2021-02-05 20:11:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 699 ms / 2,000 ms |
コード長 | 1,727 bytes |
コンパイル時間 | 351 ms |
コンパイル使用メモリ | 86,956 KB |
実行使用メモリ | 111,364 KB |
最終ジャッジ日時 | 2023-09-17 06:34:03 |
合計ジャッジ時間 | 28,142 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,252 KB |
testcase_01 | AC | 72 ms
71,056 KB |
testcase_02 | AC | 72 ms
71,300 KB |
testcase_03 | AC | 72 ms
71,188 KB |
testcase_04 | AC | 71 ms
71,300 KB |
testcase_05 | AC | 73 ms
71,196 KB |
testcase_06 | AC | 319 ms
86,088 KB |
testcase_07 | AC | 275 ms
85,148 KB |
testcase_08 | AC | 241 ms
83,528 KB |
testcase_09 | AC | 306 ms
86,756 KB |
testcase_10 | AC | 284 ms
85,988 KB |
testcase_11 | AC | 465 ms
98,620 KB |
testcase_12 | AC | 493 ms
99,180 KB |
testcase_13 | AC | 499 ms
98,532 KB |
testcase_14 | AC | 470 ms
98,084 KB |
testcase_15 | AC | 482 ms
98,224 KB |
testcase_16 | AC | 626 ms
110,580 KB |
testcase_17 | AC | 632 ms
110,836 KB |
testcase_18 | AC | 699 ms
111,052 KB |
testcase_19 | AC | 627 ms
110,736 KB |
testcase_20 | AC | 651 ms
111,096 KB |
testcase_21 | AC | 624 ms
110,980 KB |
testcase_22 | AC | 629 ms
110,892 KB |
testcase_23 | AC | 637 ms
110,936 KB |
testcase_24 | AC | 618 ms
110,952 KB |
testcase_25 | AC | 654 ms
111,364 KB |
testcase_26 | AC | 528 ms
99,064 KB |
testcase_27 | AC | 509 ms
99,368 KB |
testcase_28 | AC | 497 ms
99,256 KB |
testcase_29 | AC | 496 ms
99,324 KB |
testcase_30 | AC | 449 ms
101,572 KB |
testcase_31 | AC | 426 ms
94,120 KB |
testcase_32 | AC | 494 ms
98,564 KB |
testcase_33 | AC | 467 ms
97,232 KB |
testcase_34 | AC | 391 ms
91,608 KB |
testcase_35 | AC | 312 ms
87,332 KB |
testcase_36 | AC | 272 ms
96,304 KB |
testcase_37 | AC | 155 ms
81,296 KB |
testcase_38 | AC | 289 ms
98,516 KB |
testcase_39 | AC | 176 ms
83,532 KB |
testcase_40 | AC | 248 ms
92,564 KB |
testcase_41 | AC | 252 ms
92,220 KB |
testcase_42 | AC | 276 ms
95,048 KB |
testcase_43 | AC | 262 ms
92,760 KB |
testcase_44 | AC | 178 ms
84,476 KB |
testcase_45 | AC | 243 ms
91,040 KB |
testcase_46 | AC | 207 ms
84,368 KB |
testcase_47 | AC | 347 ms
98,752 KB |
testcase_48 | AC | 304 ms
92,096 KB |
testcase_49 | AC | 366 ms
100,560 KB |
testcase_50 | AC | 248 ms
88,724 KB |
testcase_51 | AC | 491 ms
106,424 KB |
testcase_52 | AC | 559 ms
110,768 KB |
testcase_53 | AC | 284 ms
87,044 KB |
testcase_54 | AC | 359 ms
94,240 KB |
testcase_55 | AC | 546 ms
110,004 KB |
testcase_56 | AC | 317 ms
89,376 KB |
testcase_57 | AC | 415 ms
100,256 KB |
testcase_58 | AC | 256 ms
83,784 KB |
testcase_59 | AC | 313 ms
89,000 KB |
testcase_60 | AC | 509 ms
108,552 KB |
testcase_61 | AC | 124 ms
78,016 KB |
testcase_62 | AC | 73 ms
71,060 KB |
testcase_63 | AC | 155 ms
79,452 KB |
testcase_64 | AC | 128 ms
77,924 KB |
testcase_65 | AC | 97 ms
76,456 KB |
testcase_66 | AC | 119 ms
77,892 KB |
testcase_67 | AC | 130 ms
78,132 KB |
testcase_68 | AC | 131 ms
78,148 KB |
testcase_69 | AC | 125 ms
77,812 KB |
testcase_70 | AC | 136 ms
78,176 KB |
ソースコード
class UnionFind: def __init__(self, n): self.parent = [-1] * n self.rank = [1] * n self.count = [1] * n def get_root(self, i): while self.parent[i] != -1: i = self.parent[i] return i def is_same_tree(self, i, j): return self.get_root(i) == self.get_root(j) def merge(self, i, j): i = self.get_root(i) j = self.get_root(j) if i == j: return if self.rank[i] > self.rank[j]: self.parent[j] = i self.rank[i] = max(self.rank[i], self.rank[j] + 1) self.count[i] += self.count[j] else: self.parent[i] = j self.rank[j] = max(self.rank[j], self.rank[i] + 1) self.count[j] += self.count[i] n, m, s, t = map(int, input().split()) s -= 1 t -= 1 p = [int(i) for i in input().split()] pd = {} for ind, i in enumerate(p): if i not in pd: pd[i] = [] pd[i].append(ind) e = [[] for _ in range(n)] for _ in range(m): a, b = [int(i) - 1 for i in input().split()] e[a].append(b) e[b].append(a) uf = UnionFind(n) dp = [-float("inf")] * n used = [False] * n for p_key in sorted(pd.keys(), reverse=True): a = [] for i in pd[p_key]: if i == s: a.append(0) else: aa = -float("inf") for j in e[i]: if used[j]: aa = max(aa, dp[uf.get_root(j)]) a.append(aa+1) for i in pd[p_key]: used[i] = True for j in e[i]: if used[j]: uf.merge(i, j) for i, aa in zip(pd[p_key], a): r = uf.get_root(i) dp[r] = max(dp[r], aa) print(dp[uf.get_root(t)])