結果

問題 No.1640 簡単な色塗り
ユーザー NatsubiSoganNatsubiSogan
提出日時 2021-08-06 22:56:05
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,377 bytes
コンパイル時間 183 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 348,016 KB
最終ジャッジ日時 2024-06-29 16:04:09
合計ジャッジ時間 53,061 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
54,956 KB
testcase_01 AC 36 ms
54,656 KB
testcase_02 AC 37 ms
54,016 KB
testcase_03 AC 37 ms
54,144 KB
testcase_04 AC 265 ms
139,352 KB
testcase_05 AC 895 ms
259,480 KB
testcase_06 AC 40 ms
54,632 KB
testcase_07 AC 38 ms
54,656 KB
testcase_08 AC 36 ms
54,144 KB
testcase_09 AC 38 ms
54,400 KB
testcase_10 AC 888 ms
130,468 KB
testcase_11 AC 708 ms
118,576 KB
testcase_12 AC 653 ms
110,240 KB
testcase_13 AC 1,058 ms
150,844 KB
testcase_14 AC 1,076 ms
152,236 KB
testcase_15 AC 545 ms
101,200 KB
testcase_16 AC 620 ms
108,184 KB
testcase_17 AC 959 ms
143,248 KB
testcase_18 AC 234 ms
84,048 KB
testcase_19 AC 659 ms
111,384 KB
testcase_20 AC 818 ms
125,736 KB
testcase_21 AC 718 ms
118,904 KB
testcase_22 AC 200 ms
81,572 KB
testcase_23 AC 903 ms
129,372 KB
testcase_24 AC 378 ms
90,960 KB
testcase_25 AC 700 ms
111,720 KB
testcase_26 AC 971 ms
134,756 KB
testcase_27 AC 539 ms
100,408 KB
testcase_28 AC 1,056 ms
149,460 KB
testcase_29 AC 945 ms
137,424 KB
testcase_30 AC 414 ms
102,344 KB
testcase_31 TLE -
testcase_32 AC 1,942 ms
324,832 KB
testcase_33 AC 1,064 ms
213,488 KB
testcase_34 AC 1,287 ms
210,756 KB
testcase_35 AC 1,315 ms
264,292 KB
testcase_36 AC 450 ms
115,820 KB
testcase_37 AC 451 ms
108,072 KB
testcase_38 AC 1,679 ms
290,016 KB
testcase_39 AC 943 ms
181,548 KB
testcase_40 AC 817 ms
153,908 KB
testcase_41 AC 1,480 ms
275,340 KB
testcase_42 AC 907 ms
166,776 KB
testcase_43 AC 1,016 ms
233,924 KB
testcase_44 AC 1,104 ms
231,464 KB
testcase_45 AC 621 ms
132,584 KB
testcase_46 AC 409 ms
106,280 KB
testcase_47 AC 280 ms
97,232 KB
testcase_48 AC 1,415 ms
228,824 KB
testcase_49 AC 173 ms
84,636 KB
testcase_50 AC 36 ms
54,016 KB
testcase_51 AC 37 ms
54,528 KB
testcase_52 AC 1,925 ms
348,016 KB
testcase_53 TLE -
07_evil_01.txt AC 1,985 ms
252,716 KB
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