結果

問題 No.1640 簡単な色塗り
ユーザー ansainansain
提出日時 2021-08-06 22:37:03
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,622 bytes
コンパイル時間 305 ms
コンパイル使用メモリ 87,040 KB
実行使用メモリ 125,988 KB
最終ジャッジ日時 2023-09-12 02:34:56
合計ジャッジ時間 29,001 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 95 ms
71,652 KB
testcase_01 AC 92 ms
71,652 KB
testcase_02 AC 96 ms
71,664 KB
testcase_03 AC 95 ms
71,640 KB
testcase_04 AC 218 ms
105,632 KB
testcase_05 AC 264 ms
122,136 KB
testcase_06 AC 95 ms
71,840 KB
testcase_07 AC 93 ms
71,640 KB
testcase_08 AC 94 ms
71,676 KB
testcase_09 WA -
testcase_10 AC 408 ms
106,200 KB
testcase_11 AC 379 ms
101,708 KB
testcase_12 AC 353 ms
97,880 KB
testcase_13 AC 514 ms
120,808 KB
testcase_14 AC 505 ms
118,936 KB
testcase_15 AC 313 ms
94,080 KB
testcase_16 AC 338 ms
97,072 KB
testcase_17 AC 455 ms
113,528 KB
testcase_18 AC 193 ms
81,480 KB
testcase_19 AC 355 ms
98,780 KB
testcase_20 AC 400 ms
106,416 KB
testcase_21 AC 370 ms
100,876 KB
testcase_22 AC 172 ms
80,728 KB
testcase_23 AC 415 ms
108,432 KB
testcase_24 AC 265 ms
88,756 KB
testcase_25 AC 366 ms
99,136 KB
testcase_26 AC 458 ms
110,912 KB
testcase_27 AC 311 ms
92,816 KB
testcase_28 AC 502 ms
118,452 KB
testcase_29 AC 453 ms
110,736 KB
testcase_30 AC 231 ms
84,712 KB
testcase_31 AC 484 ms
119,428 KB
testcase_32 AC 438 ms
114,852 KB
testcase_33 AC 366 ms
103,056 KB
testcase_34 AC 405 ms
108,804 KB
testcase_35 AC 370 ms
103,084 KB
testcase_36 AC 237 ms
84,544 KB
testcase_37 AC 261 ms
88,188 KB
testcase_38 AC 459 ms
115,968 KB
testcase_39 AC 319 ms
95,268 KB
testcase_40 AC 311 ms
94,796 KB
testcase_41 AC 427 ms
110,760 KB
testcase_42 AC 345 ms
97,600 KB
testcase_43 AC 342 ms
97,656 KB
testcase_44 AC 348 ms
98,316 KB
testcase_45 AC 311 ms
93,460 KB
testcase_46 AC 242 ms
85,488 KB
testcase_47 AC 213 ms
82,912 KB
testcase_48 AC 456 ms
116,420 KB
testcase_49 AC 162 ms
80,300 KB
testcase_50 AC 94 ms
71,672 KB
testcase_51 AC 95 ms
71,772 KB
testcase_52 AC 595 ms
125,172 KB
testcase_53 AC 635 ms
125,988 KB
07_evil_01.txt AC 1,049 ms
170,100 KB
07_evil_02.txt AC 1,450 ms
216,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict
import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


# https://note.nkmk.me/python-union-find/から一部改変


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group_num = n
        self.check = [0]*n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        self.group_num -= 1
        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x
        self.check[x] |= self.check[y]

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return self.group_num

    def all_group_members(self):
        self.all_group_member = defaultdict(list)
        for i in range(self.n):
            self.all_group_member[self.find(i)].append(i)
        return self.all_group_member

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def main():
    mod = 10**9+7
    mod2 = 998244353
    n = int(input())
    uf = UnionFind(n)
    ab = [list(map(lambda x: int(x)-1, input().split())) for i in range(n)]
    ans = [None]*n
    left = []
    edges = [[] for i in range(n)]
    for i, (a, b) in enumerate(ab):
        if uf.same(a, b):
            if uf.check[uf.find(a)]:
                yn(0)
                return
            uf.check[uf.find(a)] = 1
            left.append(a)
            ans[i] = a+1
        else:
            uf.union(a, b)
            edges[b].append([a, i])
            edges[a].append([b, i])
    if 0 != 0:
        pass
    else:
        yn(1)
        d = deque()
        dist = [-1]*n
        for l in left:
            d.append(l)
            dist[l] = 0
        while d:
            v = d.popleft()
            for i, edgenum in edges[v]:
                if dist[i] != -1:
                    continue
                dist[i] = dist[v] + 1
                ans[edgenum] = i+1
                d.append(i)

        print(*ans, sep="\n")


if __name__ == '__main__':
    main()
0