結果

問題 No.1640 簡単な色塗り
ユーザー NatsubiSoganNatsubiSogan
提出日時 2021-08-06 22:55:41
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 1,588 ms / 2,000 ms
コード長 2,377 bytes
コンパイル時間 181 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 162,004 KB
最終ジャッジ日時 2024-06-29 16:00:29
合計ジャッジ時間 43,730 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
18,204 KB
testcase_01 AC 28 ms
162,004 KB
testcase_02 AC 26 ms
18,080 KB
testcase_03 AC 26 ms
10,880 KB
testcase_04 AC 853 ms
87,948 KB
testcase_05 AC 1,023 ms
108,304 KB
testcase_06 AC 26 ms
10,880 KB
testcase_07 AC 27 ms
10,880 KB
testcase_08 AC 28 ms
11,008 KB
testcase_09 AC 27 ms
10,880 KB
testcase_10 AC 722 ms
52,460 KB
testcase_11 AC 578 ms
46,716 KB
testcase_12 AC 511 ms
39,820 KB
testcase_13 AC 1,178 ms
79,184 KB
testcase_14 AC 1,185 ms
78,828 KB
testcase_15 AC 363 ms
33,204 KB
testcase_16 AC 508 ms
37,044 KB
testcase_17 AC 869 ms
60,892 KB
testcase_18 AC 89 ms
15,744 KB
testcase_19 AC 525 ms
39,724 KB
testcase_20 AC 699 ms
51,448 KB
testcase_21 AC 524 ms
45,916 KB
testcase_22 AC 71 ms
14,080 KB
testcase_23 AC 768 ms
53,848 KB
testcase_24 AC 203 ms
22,208 KB
testcase_25 AC 479 ms
39,840 KB
testcase_26 AC 869 ms
57,304 KB
testcase_27 AC 369 ms
32,340 KB
testcase_28 AC 1,132 ms
71,328 KB
testcase_29 AC 856 ms
57,112 KB
testcase_30 AC 169 ms
21,804 KB
testcase_31 AC 1,523 ms
99,028 KB
testcase_32 AC 1,158 ms
77,516 KB
testcase_33 AC 763 ms
59,892 KB
testcase_34 AC 926 ms
75,140 KB
testcase_35 AC 726 ms
62,012 KB
testcase_36 AC 177 ms
22,324 KB
testcase_37 AC 216 ms
27,960 KB
testcase_38 AC 1,317 ms
84,512 KB
testcase_39 AC 440 ms
41,192 KB
testcase_40 AC 450 ms
39,096 KB
testcase_41 AC 1,033 ms
68,116 KB
testcase_42 AC 498 ms
46,548 KB
testcase_43 AC 549 ms
51,488 KB
testcase_44 AC 508 ms
50,504 KB
testcase_45 AC 408 ms
39,668 KB
testcase_46 AC 180 ms
24,472 KB
testcase_47 AC 127 ms
19,556 KB
testcase_48 AC 1,272 ms
93,428 KB
testcase_49 AC 67 ms
14,208 KB
testcase_50 AC 25 ms
10,880 KB
testcase_51 AC 26 ms
11,008 KB
testcase_52 AC 1,588 ms
95,348 KB
testcase_53 AC 1,547 ms
95,320 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]
def main():
    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)
    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 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")
if __name__ == '__main__':
    main()
    
0