結果
問題 | No.1382 Travel in Mitaru city |
ユーザー | Mitarushi |
提出日時 | 2021-02-07 15:39:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 742 ms / 2,000 ms |
コード長 | 1,917 bytes |
コンパイル時間 | 1,303 ms |
コンパイル使用メモリ | 86,984 KB |
実行使用メモリ | 120,640 KB |
最終ジャッジ日時 | 2023-09-17 06:43:38 |
合計ジャッジ時間 | 31,309 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
70,684 KB |
testcase_01 | AC | 73 ms
70,652 KB |
testcase_02 | AC | 73 ms
70,760 KB |
testcase_03 | AC | 72 ms
70,736 KB |
testcase_04 | AC | 71 ms
71,076 KB |
testcase_05 | AC | 72 ms
70,656 KB |
testcase_06 | AC | 361 ms
94,512 KB |
testcase_07 | AC | 305 ms
91,024 KB |
testcase_08 | AC | 256 ms
85,928 KB |
testcase_09 | AC | 344 ms
96,480 KB |
testcase_10 | AC | 325 ms
94,360 KB |
testcase_11 | AC | 492 ms
104,944 KB |
testcase_12 | AC | 539 ms
106,424 KB |
testcase_13 | AC | 540 ms
106,724 KB |
testcase_14 | AC | 507 ms
104,668 KB |
testcase_15 | AC | 519 ms
104,684 KB |
testcase_16 | AC | 683 ms
120,196 KB |
testcase_17 | AC | 696 ms
120,048 KB |
testcase_18 | AC | 742 ms
120,556 KB |
testcase_19 | AC | 656 ms
120,068 KB |
testcase_20 | AC | 702 ms
120,052 KB |
testcase_21 | AC | 700 ms
120,104 KB |
testcase_22 | AC | 671 ms
120,640 KB |
testcase_23 | AC | 713 ms
120,168 KB |
testcase_24 | AC | 683 ms
119,600 KB |
testcase_25 | AC | 708 ms
119,908 KB |
testcase_26 | AC | 595 ms
109,168 KB |
testcase_27 | AC | 560 ms
108,032 KB |
testcase_28 | AC | 542 ms
109,448 KB |
testcase_29 | AC | 542 ms
109,000 KB |
testcase_30 | AC | 504 ms
110,988 KB |
testcase_31 | AC | 464 ms
102,464 KB |
testcase_32 | AC | 548 ms
107,976 KB |
testcase_33 | AC | 514 ms
106,764 KB |
testcase_34 | AC | 413 ms
97,540 KB |
testcase_35 | AC | 330 ms
90,088 KB |
testcase_36 | AC | 301 ms
103,664 KB |
testcase_37 | AC | 161 ms
81,796 KB |
testcase_38 | AC | 318 ms
107,092 KB |
testcase_39 | AC | 184 ms
85,944 KB |
testcase_40 | AC | 274 ms
98,780 KB |
testcase_41 | AC | 280 ms
99,996 KB |
testcase_42 | AC | 316 ms
105,032 KB |
testcase_43 | AC | 288 ms
100,828 KB |
testcase_44 | AC | 190 ms
86,812 KB |
testcase_45 | AC | 272 ms
98,788 KB |
testcase_46 | AC | 216 ms
85,396 KB |
testcase_47 | AC | 385 ms
105,708 KB |
testcase_48 | AC | 327 ms
97,144 KB |
testcase_49 | AC | 405 ms
110,512 KB |
testcase_50 | AC | 271 ms
93,700 KB |
testcase_51 | AC | 543 ms
114,776 KB |
testcase_52 | AC | 607 ms
119,908 KB |
testcase_53 | AC | 296 ms
88,684 KB |
testcase_54 | AC | 386 ms
98,872 KB |
testcase_55 | AC | 588 ms
118,880 KB |
testcase_56 | AC | 336 ms
91,644 KB |
testcase_57 | AC | 441 ms
105,796 KB |
testcase_58 | AC | 260 ms
85,472 KB |
testcase_59 | AC | 325 ms
91,412 KB |
testcase_60 | AC | 565 ms
118,172 KB |
testcase_61 | AC | 127 ms
77,620 KB |
testcase_62 | AC | 74 ms
71,144 KB |
testcase_63 | AC | 169 ms
81,592 KB |
testcase_64 | AC | 134 ms
78,856 KB |
testcase_65 | AC | 99 ms
76,548 KB |
testcase_66 | AC | 123 ms
77,720 KB |
testcase_67 | AC | 134 ms
78,196 KB |
testcase_68 | AC | 134 ms
79,088 KB |
testcase_69 | AC | 125 ms
77,748 KB |
testcase_70 | AC | 142 ms
79,912 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()) assert 2<=n<=10**5 and 1<=m<=10**5, 1<=s<=n and 1<=t<=n assert s != t s -= 1 t -= 1 p = [int(i) for i in input().split()] assert 1<=min(p) <= 10**9 and 1<=max(p) <= 10**9 pd = {} for ind, i in enumerate(p): if i not in pd: pd[i] = [] pd[i].append(ind) ss = set() e = [[] for _ in range(n)] for _ in range(m): a, b = [int(i) - 1 for i in input().split()] assert a<b e[a].append(b) e[b].append(a) assert (a,b) not in ss ss.add((a,b)) 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)])