結果
問題 | No.1640 簡単な色塗り |
ユーザー | NatsubiSogan |
提出日時 | 2021-08-06 22:45:46 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,193 bytes |
コンパイル時間 | 818 ms |
コンパイル使用メモリ | 87,328 KB |
実行使用メモリ | 848,080 KB |
最終ジャッジ日時 | 2023-09-12 02:46:50 |
合計ジャッジ時間 | 29,888 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,692 KB |
testcase_01 | AC | 92 ms
71,792 KB |
testcase_02 | AC | 94 ms
71,872 KB |
testcase_03 | AC | 94 ms
71,720 KB |
testcase_04 | AC | 346 ms
139,976 KB |
testcase_05 | AC | 936 ms
252,036 KB |
testcase_06 | AC | 97 ms
71,884 KB |
testcase_07 | AC | 92 ms
71,920 KB |
testcase_08 | AC | 94 ms
71,716 KB |
testcase_09 | AC | 93 ms
71,620 KB |
testcase_10 | AC | 1,099 ms
149,988 KB |
testcase_11 | AC | 915 ms
128,304 KB |
testcase_12 | AC | 868 ms
124,200 KB |
testcase_13 | AC | 1,399 ms
166,212 KB |
testcase_14 | AC | 1,378 ms
173,772 KB |
testcase_15 | AC | 745 ms
114,760 KB |
testcase_16 | AC | 874 ms
125,972 KB |
testcase_17 | AC | 1,270 ms
163,764 KB |
testcase_18 | AC | 334 ms
89,612 KB |
testcase_19 | AC | 878 ms
120,416 KB |
testcase_20 | AC | 1,098 ms
137,188 KB |
testcase_21 | AC | 958 ms
129,388 KB |
testcase_22 | AC | 268 ms
88,656 KB |
testcase_23 | AC | 1,175 ms
143,868 KB |
testcase_24 | AC | 567 ms
100,828 KB |
testcase_25 | AC | 916 ms
122,044 KB |
testcase_26 | AC | 1,147 ms
149,588 KB |
testcase_27 | AC | 694 ms
110,044 KB |
testcase_28 | AC | 1,295 ms
174,900 KB |
testcase_29 | AC | 1,172 ms
150,632 KB |
testcase_30 | AC | 858 ms
338,548 KB |
testcase_31 | MLE | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
07_evil_01.txt | -- | - |
07_evil_02.txt | -- | - |
ソースコード
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] 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) visit = [0] * n def dfs2(v): visit[v] = 1 for u in G[v]: if (not visit[u]) and (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")