結果
問題 | No.1640 簡単な色塗り |
ユーザー | NatsubiSogan |
提出日時 | 2021-08-06 22:55:56 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,377 bytes |
コンパイル時間 | 84 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 161,396 KB |
最終ジャッジ日時 | 2024-06-29 16:05:36 |
合計ジャッジ時間 | 52,713 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
16,384 KB |
testcase_01 | AC | 31 ms
161,396 KB |
testcase_02 | AC | 31 ms
16,384 KB |
testcase_03 | AC | 29 ms
11,008 KB |
testcase_04 | AC | 989 ms
88,172 KB |
testcase_05 | AC | 1,226 ms
108,332 KB |
testcase_06 | AC | 31 ms
11,008 KB |
testcase_07 | AC | 30 ms
11,008 KB |
testcase_08 | AC | 31 ms
11,008 KB |
testcase_09 | AC | 31 ms
10,880 KB |
testcase_10 | AC | 941 ms
52,564 KB |
testcase_11 | AC | 766 ms
46,756 KB |
testcase_12 | AC | 647 ms
39,816 KB |
testcase_13 | AC | 1,396 ms
79,412 KB |
testcase_14 | AC | 1,519 ms
79,024 KB |
testcase_15 | AC | 464 ms
33,460 KB |
testcase_16 | AC | 658 ms
36,796 KB |
testcase_17 | AC | 1,156 ms
61,024 KB |
testcase_18 | AC | 107 ms
15,872 KB |
testcase_19 | AC | 665 ms
39,592 KB |
testcase_20 | AC | 889 ms
51,372 KB |
testcase_21 | AC | 683 ms
45,736 KB |
testcase_22 | AC | 83 ms
14,080 KB |
testcase_23 | AC | 987 ms
53,772 KB |
testcase_24 | AC | 249 ms
22,340 KB |
testcase_25 | AC | 632 ms
40,092 KB |
testcase_26 | AC | 1,130 ms
57,336 KB |
testcase_27 | AC | 471 ms
32,344 KB |
testcase_28 | AC | 1,410 ms
71,176 KB |
testcase_29 | AC | 1,107 ms
56,976 KB |
testcase_30 | AC | 224 ms
21,804 KB |
testcase_31 | AC | 1,939 ms
98,976 KB |
testcase_32 | AC | 1,481 ms
77,452 KB |
testcase_33 | AC | 1,011 ms
59,892 KB |
testcase_34 | AC | 1,258 ms
75,296 KB |
testcase_35 | AC | 925 ms
61,924 KB |
testcase_36 | AC | 236 ms
22,448 KB |
testcase_37 | AC | 287 ms
27,960 KB |
testcase_38 | AC | 1,630 ms
84,484 KB |
testcase_39 | AC | 570 ms
41,452 KB |
testcase_40 | AC | 591 ms
39,088 KB |
testcase_41 | AC | 1,248 ms
67,904 KB |
testcase_42 | AC | 689 ms
46,548 KB |
testcase_43 | AC | 734 ms
51,436 KB |
testcase_44 | AC | 697 ms
50,760 KB |
testcase_45 | AC | 516 ms
39,412 KB |
testcase_46 | AC | 237 ms
24,472 KB |
testcase_47 | AC | 151 ms
19,684 KB |
testcase_48 | AC | 1,605 ms
93,348 KB |
testcase_49 | AC | 80 ms
14,336 KB |
testcase_50 | AC | 31 ms
10,880 KB |
testcase_51 | AC | 31 ms
11,136 KB |
testcase_52 | TLE | - |
testcase_53 | AC | 1,932 ms
95,448 KB |
07_evil_01.txt | TLE | - |
07_evil_02.txt | TLE | - |
ソースコード
import sys sys.setrecursionlimit(10 ** 7) input = sys.stdin.buffer.readline #Union-Find class UnionFind(): def __init__(self, n: int) -> None: self.n = n self.par = list(range(self.n)) self.rank = [1] * self.n def find(self, x: int) -> int: if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] def unite(self, x: int, y: int) -> None: p = self.find(x) q = self.find(y) if p == q: return None if p > q: p, q = q, p self.rank[p] += self.rank[q] self.par[q] = p def same(self, x: int, y: int) -> bool: return self.find(x) == self.find(y) def size(self, x: int) -> int: return self.rank[x] def main(): n = int(input()) G = [[] for i in range(n)] UF = UnionFind(n) from collections import defaultdict ed_ind = defaultdict(list) for i in range(n): a, b = map(int, input().split()) if a > b: a, b = b, a G[a - 1].append(b - 1) G[b - 1].append(a - 1) UF.unite(a - 1, b - 1) ed_ind[(a - 1, b - 1)].append(i) done = [0] * n visit = [0] * n used = defaultdict(int) def dfs(v): visit[v] = 1 for u in G[v]: if not visit[u]: dfs(u) used[(min(u, v), max(u, v))] += 1 for i in range(n): dfs(i) def dfs2(v): for u in G[v]: if used[(min(u, v), max(u, v))] > 0: for i in ed_ind[(min(u, v), max(u, v))]: if ans[i] == 0: ans[i] = u + 1 dfs2(u) break ans = [0] * n for i in range(n): if not done[UF.find(i)]: for v in G[i]: if used[(min(v, i), max(v, i))] < len(ed_ind[(min(v, i), max(v, i))]): for x in ed_ind[(min(v, i), max(v, i))]: if ans[x] == 0: ans[x] = i + 1 dfs2(i) break done[UF.find(i)] = 1 break if any(i == 0 for i in ans) or len(set(ans)) != n: exit(print("No")) print("Yes") print(*ans, sep="\n") if __name__ == '__main__': main()