結果
問題 | No.1640 簡単な色塗り |
ユーザー | rlangevin |
提出日時 | 2023-12-25 20:50:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 578 ms / 2,000 ms |
コード長 | 1,738 bytes |
コンパイル時間 | 278 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 152,940 KB |
最終ジャッジ日時 | 2023-12-25 20:50:30 |
合計ジャッジ時間 | 26,277 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
55,608 KB |
testcase_01 | AC | 41 ms
55,608 KB |
testcase_02 | AC | 41 ms
55,608 KB |
testcase_03 | AC | 41 ms
55,608 KB |
testcase_04 | AC | 236 ms
152,940 KB |
testcase_05 | AC | 153 ms
98,564 KB |
testcase_06 | AC | 40 ms
55,608 KB |
testcase_07 | AC | 41 ms
55,608 KB |
testcase_08 | AC | 41 ms
55,608 KB |
testcase_09 | AC | 41 ms
55,608 KB |
testcase_10 | AC | 373 ms
92,352 KB |
testcase_11 | AC | 330 ms
89,356 KB |
testcase_12 | AC | 318 ms
88,416 KB |
testcase_13 | AC | 494 ms
99,588 KB |
testcase_14 | AC | 453 ms
99,256 KB |
testcase_15 | AC | 276 ms
85,372 KB |
testcase_16 | AC | 297 ms
87,264 KB |
testcase_17 | AC | 410 ms
95,564 KB |
testcase_18 | AC | 150 ms
78,868 KB |
testcase_19 | AC | 315 ms
88,520 KB |
testcase_20 | AC | 358 ms
91,188 KB |
testcase_21 | AC | 339 ms
89,028 KB |
testcase_22 | AC | 136 ms
78,356 KB |
testcase_23 | AC | 370 ms
92,256 KB |
testcase_24 | AC | 214 ms
82,428 KB |
testcase_25 | AC | 329 ms
88,880 KB |
testcase_26 | AC | 398 ms
93,604 KB |
testcase_27 | AC | 267 ms
84,528 KB |
testcase_28 | AC | 449 ms
98,276 KB |
testcase_29 | AC | 396 ms
94,088 KB |
testcase_30 | AC | 190 ms
81,000 KB |
testcase_31 | AC | 458 ms
100,408 KB |
testcase_32 | AC | 418 ms
97,764 KB |
testcase_33 | AC | 333 ms
91,504 KB |
testcase_34 | AC | 379 ms
94,272 KB |
testcase_35 | AC | 334 ms
91,396 KB |
testcase_36 | AC | 191 ms
80,872 KB |
testcase_37 | AC | 221 ms
82,244 KB |
testcase_38 | AC | 426 ms
99,228 KB |
testcase_39 | AC | 271 ms
86,396 KB |
testcase_40 | AC | 272 ms
87,212 KB |
testcase_41 | AC | 401 ms
95,212 KB |
testcase_42 | AC | 286 ms
88,480 KB |
testcase_43 | AC | 294 ms
88,236 KB |
testcase_44 | AC | 291 ms
88,680 KB |
testcase_45 | AC | 262 ms
85,872 KB |
testcase_46 | AC | 202 ms
81,524 KB |
testcase_47 | AC | 175 ms
79,836 KB |
testcase_48 | AC | 432 ms
98,888 KB |
testcase_49 | AC | 123 ms
78,100 KB |
testcase_50 | AC | 41 ms
55,608 KB |
testcase_51 | AC | 41 ms
55,608 KB |
testcase_52 | AC | 543 ms
114,504 KB |
testcase_53 | AC | 578 ms
108,568 KB |
07_evil_01.txt | AC | 904 ms
125,704 KB |
07_evil_02.txt | AC | 1,171 ms
149,612 KB |
ソースコード
import sys input = sys.stdin.readline from collections import * class UnionFind(object): def __init__(self, n=1): self.par = [i for i in range(n)] self.rank = [0 for _ in range(n)] self.size = [1 for _ in range(n)] def find(self, x): if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x != y: if self.rank[x] < self.rank[y]: x, y = y, x if self.rank[x] == self.rank[y]: self.rank[x] += 1 self.par[y] = x self.size[x] += self.size[y] def is_same(self, x, y): return self.find(x) == self.find(y) def get_size(self, x): x = self.find(x) return self.size[x] N = int(input()) A, B = [0] * N, [0] * N G = [[] for i in range(N)] U = UnionFind(N) Q = [] cnt = [0] * N ans, seen = [-1] * N, [0] * N for i in range(N): A[i], B[i] = map(int, input().split()) A[i], B[i] = A[i] - 1, B[i] - 1 if not U.is_same(A[i], B[i]): G[A[i]].append((B[i], i)) G[B[i]].append((A[i], i)) else: Q.append(deque([A[i]])) seen[A[i]] = 1 ans[i] = A[i] + 1 U.union(A[i], B[i]) for i in range(N): ui = U.find(A[i]) cnt[ui] += 1 if cnt[ui] > U.get_size(ui): print("No") exit() for qs in Q: while qs: u = qs.popleft() for v, ind in G[u]: if seen[v]: continue ans[ind] = v + 1 qs.append(v) seen[v] = 1 print("Yes") for a in ans: print(a)