結果

問題 No.1640 簡単な色塗り
ユーザー NatsubiSoganNatsubiSogan
提出日時 2021-08-06 22:54:17
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
RE  
実行時間 -
コード長 2,406 bytes
コンパイル時間 72 ms
コンパイル使用メモリ 12,928 KB
実行使用メモリ 160,200 KB
最終ジャッジ日時 2024-06-29 16:01:55
合計ジャッジ時間 46,607 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
17,828 KB
testcase_01 AC 25 ms
160,200 KB
testcase_02 AC 25 ms
17,952 KB
testcase_03 AC 27 ms
10,880 KB
testcase_04 AC 1,232 ms
87,976 KB
testcase_05 AC 1,214 ms
104,348 KB
testcase_06 AC 26 ms
11,008 KB
testcase_07 AC 26 ms
11,008 KB
testcase_08 AC 26 ms
11,008 KB
testcase_09 RE -
testcase_10 AC 892 ms
52,660 KB
testcase_11 AC 707 ms
46,832 KB
testcase_12 AC 580 ms
39,712 KB
testcase_13 AC 1,235 ms
79,436 KB
testcase_14 AC 1,402 ms
78,980 KB
testcase_15 AC 406 ms
33,376 KB
testcase_16 AC 618 ms
36,832 KB
testcase_17 AC 1,005 ms
61,080 KB
testcase_18 AC 102 ms
16,000 KB
testcase_19 AC 594 ms
39,636 KB
testcase_20 AC 800 ms
51,552 KB
testcase_21 AC 594 ms
46,128 KB
testcase_22 AC 81 ms
14,080 KB
testcase_23 AC 900 ms
53,816 KB
testcase_24 AC 230 ms
22,264 KB
testcase_25 AC 570 ms
39,876 KB
testcase_26 AC 1,011 ms
57,256 KB
testcase_27 AC 430 ms
32,256 KB
testcase_28 AC 1,239 ms
71,244 KB
testcase_29 AC 994 ms
56,908 KB
testcase_30 AC 200 ms
21,960 KB
testcase_31 RE -
testcase_32 AC 1,279 ms
75,896 KB
testcase_33 RE -
testcase_34 AC 1,014 ms
72,704 KB
testcase_35 AC 769 ms
60,588 KB
testcase_36 RE -
testcase_37 AC 255 ms
27,724 KB
testcase_38 RE -
testcase_39 RE -
testcase_40 AC 472 ms
38,820 KB
testcase_41 AC 1,043 ms
66,720 KB
testcase_42 RE -
testcase_43 RE -
testcase_44 AC 606 ms
49,612 KB
testcase_45 AC 439 ms
38,564 KB
testcase_46 AC 195 ms
24,100 KB
testcase_47 AC 131 ms
19,312 KB
testcase_48 AC 1,344 ms
90,808 KB
testcase_49 AC 73 ms
14,328 KB
testcase_50 RE -
testcase_51 AC 26 ms
11,008 KB
testcase_52 AC 1,802 ms
93,524 KB
testcase_53 AC 1,769 ms
93,608 KB
07_evil_01.txt TLE -
07_evil_02.txt TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 = dict()
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)
    if (a - 1, b - 1) not in ed_ind: ed_ind[(a - 1, b - 1)] = []
    ed_ind[(a - 1, b - 1)].append(i)
done = [0] * n
visit = [0] * n
used = dict()
def dfs(v):
    visit[v] = 1
    for u in G[v]:
        if not visit[u]: 
            dfs(u)
            if (min(u, v), max(u, v)) not in used:
                used[(min(u, v), max(u, v))] = 1
            else:
                used[(min(u, v), max(u, v))] += 1
for i in range(n):
    if not visit[i]: 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 (min(v, i), max(v, i)) not in used: used[(min(v, i), max(v, i))] = 0
            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")
0