結果
問題 | No.1640 簡単な色塗り |
ユーザー | mkawa2 |
提出日時 | 2021-08-07 00:18:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 502 ms / 2,000 ms |
コード長 | 2,529 bytes |
コンパイル時間 | 1,748 ms |
コンパイル使用メモリ | 87,388 KB |
実行使用メモリ | 112,340 KB |
最終ジャッジ日時 | 2023-09-12 03:36:42 |
合計ジャッジ時間 | 24,657 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,292 KB |
testcase_01 | AC | 73 ms
71,444 KB |
testcase_02 | AC | 73 ms
71,336 KB |
testcase_03 | AC | 71 ms
71,600 KB |
testcase_04 | AC | 245 ms
112,340 KB |
testcase_05 | AC | 242 ms
101,784 KB |
testcase_06 | AC | 74 ms
71,608 KB |
testcase_07 | AC | 74 ms
71,436 KB |
testcase_08 | AC | 76 ms
71,608 KB |
testcase_09 | AC | 74 ms
71,392 KB |
testcase_10 | AC | 369 ms
92,408 KB |
testcase_11 | AC | 342 ms
91,012 KB |
testcase_12 | AC | 301 ms
88,960 KB |
testcase_13 | AC | 471 ms
101,152 KB |
testcase_14 | AC | 464 ms
101,184 KB |
testcase_15 | AC | 296 ms
86,488 KB |
testcase_16 | AC | 296 ms
88,100 KB |
testcase_17 | AC | 416 ms
96,140 KB |
testcase_18 | AC | 179 ms
79,524 KB |
testcase_19 | AC | 316 ms
90,112 KB |
testcase_20 | AC | 365 ms
92,072 KB |
testcase_21 | AC | 337 ms
90,148 KB |
testcase_22 | AC | 172 ms
79,376 KB |
testcase_23 | AC | 384 ms
94,788 KB |
testcase_24 | AC | 244 ms
83,972 KB |
testcase_25 | AC | 329 ms
90,504 KB |
testcase_26 | AC | 409 ms
96,160 KB |
testcase_27 | AC | 286 ms
86,244 KB |
testcase_28 | AC | 423 ms
99,956 KB |
testcase_29 | AC | 406 ms
95,412 KB |
testcase_30 | AC | 173 ms
81,040 KB |
testcase_31 | AC | 326 ms
95,688 KB |
testcase_32 | AC | 301 ms
93,680 KB |
testcase_33 | AC | 255 ms
88,968 KB |
testcase_34 | AC | 280 ms
91,900 KB |
testcase_35 | AC | 248 ms
88,776 KB |
testcase_36 | AC | 174 ms
80,972 KB |
testcase_37 | AC | 189 ms
82,368 KB |
testcase_38 | AC | 326 ms
94,124 KB |
testcase_39 | AC | 210 ms
84,944 KB |
testcase_40 | AC | 213 ms
85,160 KB |
testcase_41 | AC | 280 ms
91,736 KB |
testcase_42 | AC | 218 ms
86,700 KB |
testcase_43 | AC | 225 ms
86,912 KB |
testcase_44 | AC | 219 ms
86,604 KB |
testcase_45 | AC | 202 ms
84,052 KB |
testcase_46 | AC | 173 ms
81,500 KB |
testcase_47 | AC | 169 ms
79,924 KB |
testcase_48 | AC | 310 ms
94,804 KB |
testcase_49 | AC | 140 ms
79,148 KB |
testcase_50 | AC | 74 ms
71,284 KB |
testcase_51 | AC | 72 ms
71,400 KB |
testcase_52 | AC | 455 ms
103,032 KB |
testcase_53 | AC | 502 ms
103,312 KB |
07_evil_01.txt | AC | 891 ms
129,336 KB |
07_evil_02.txt | AC | 1,259 ms
153,700 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 class UnionFind: def __init__(self, n): self.state = [-1]*n self.e = [0]*n self.size_table = [1]*n # cntはグループ数 self.cnt = n def root(self, u): stack = [] while self.state[u] >= 0: stack.append(u) u = self.state[u] for v in stack: self.state[v] = u return u def merge(self, u, v): u = self.root(u) v = self.root(v) self.e[u] += 1 if u == v: return du = -self.state[u] dv = -self.state[v] if du < dv: u, v = v, u if du == dv: self.state[u] -= 1 self.state[v] = u self.cnt -= 1 self.size_table[u] += self.size_table[v] self.e[u] += self.e[v] return # グループの要素数 def size(self, u): return self.size_table[self.root(u)] def cnt_egde(self, u): u = self.root(u) return self.e[u] n = II() uf = UnionFind(n) to = [[] for _ in range(n)] for i in range(n): a, b = LI1() to[a].append((b, i)) to[b].append((a, i)) uf.merge(a, b) fin = set() for u in range(n): u = uf.root(u) if u in fin: continue fin.add(u) if uf.size(u) != uf.cnt_egde(u): print("No") exit() def dfs(u): stack = [(u, -1)] while stack: u, par = stack.pop() for v, i in to[u]: if v == par: continue if vis[v]: ans[i] = v+1 ee[i] = True return v vis[v] = True stack.append((v, u)) def match(u): stack = [u] while stack: u = stack.pop() for v, i in to[u]: if ee[i]: continue ee[i] = True ans[i] = v+1 stack.append(v) ans = [-1]*n ee = [False]*n vis = [False]*n for u in fin: r = dfs(u) match(r) print("Yes") print(*ans, sep="\n")