結果
問題 | No.1640 簡単な色塗り |
ユーザー |
![]() |
提出日時 | 2021-12-03 00:11:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 244 ms / 2,000 ms |
コード長 | 1,450 bytes |
コンパイル時間 | 2,339 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 117,244 KB |
最終ジャッジ日時 | 2024-07-05 02:32:11 |
合計ジャッジ時間 | 18,305 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
ソースコード
from sys import stdinn, *indata = map(int, stdin.read().split())remained = [0 for i in range(n+1)]g = [[] for i in range(n+1)]offset = 0for i in range(n):s, t = indata[offset + 2*i],indata[offset + 2*i+1]g[s].append((t,i))g[t].append((s,i))remained[s] += 1remained[t] += 1que = []for i in range(1,n+1):if remained[i] == 0:print("No")exit()if remained[i] == 1:que.append(i)used = [False for i in range(n)]ans = [0 for i in range(n)]check = [False for i in range(n+1)]while que:now = que.pop()check[now] = Trueif remained[now] == 0:print("No")exit()for i, ind in g[now]:if not used[ind]:used[ind] = Trueans[ind] = nowremained[i] -= 1if remained[i] == 1:que.append(i)breakfor i in range(1,n+1):if not check[i]:que.append(i)while que:now = que.pop()check[now] = Trueif remained[now] == 0:print("No")exit()for i, ind in g[now]:if not used[ind]:used[ind] = Trueans[ind] = nowremained[i] -= 1if remained[i] == 1:que.append(i)breakprint("Yes")for i in range(n):print("{}".format(ans[i]))