#687110 (Python3) No.1640 簡単な色塗り

提出ソース

結果

問題	No.1640 簡単な色塗り
ユーザー	ansain
提出日時	2021-08-07 03:54:38
言語	Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果	AC
実行時間	800 ms / 2,000 ms
コード長	3,716 bytes
コンパイル時間	177 ms
コンパイル使用メモリ	11,128 KB
実行使用メモリ	80,860 KB
最終ジャッジ日時	2023-09-12 03:38:48
合計ジャッジ時間	27,340 ms
ジャッジサーバーID （参考情報）	judge15 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	19 ms 9,032 KB
testcase_01	AC	19 ms 8,904 KB
testcase_02	AC	19 ms 8,904 KB
testcase_03	AC	19 ms 8,876 KB
testcase_04	AC	330 ms 56,616 KB
testcase_05	AC	497 ms 80,860 KB
testcase_06	AC	19 ms 8,884 KB
testcase_07	AC	18 ms 9,016 KB
testcase_08	AC	19 ms 8,864 KB
testcase_09	AC	19 ms 8,872 KB
testcase_10	AC	381 ms 48,400 KB
testcase_11	AC	309 ms 41,280 KB
testcase_12	AC	266 ms 38,464 KB
testcase_13	AC	652 ms 73,056 KB
testcase_14	AC	653 ms 73,104 KB
testcase_15	AC	201 ms 31,460 KB
testcase_16	AC	230 ms 35,592 KB
testcase_17	AC	533 ms 57,568 KB
testcase_18	AC	50 ms 13,984 KB
testcase_19	AC	257 ms 37,952 KB
testcase_20	AC	381 ms 46,676 KB
testcase_21	AC	305 ms 40,516 KB
testcase_22	AC	41 ms 11,848 KB
testcase_23	AC	417 ms 49,428 KB
testcase_24	AC	103 ms 19,956 KB
testcase_25	AC	272 ms 38,532 KB
testcase_26	AC	450 ms 53,056 KB
testcase_27	AC	187 ms 30,584 KB
testcase_28	AC	629 ms 70,720 KB
testcase_29	AC	453 ms 52,948 KB
testcase_30	AC	75 ms 16,404 KB
testcase_31	AC	612 ms 58,664 KB
testcase_32	AC	481 ms 52,220 KB
testcase_33	AC	307 ms 38,396 KB
testcase_34	AC	430 ms 45,536 KB
testcase_35	AC	307 ms 38,352 KB
testcase_36	AC	73 ms 16,384 KB
testcase_37	AC	97 ms 19,176 KB
testcase_38	AC	501 ms 54,088 KB
testcase_39	AC	180 ms 28,264 KB
testcase_40	AC	183 ms 28,784 KB
testcase_41	AC	410 ms 46,524 KB
testcase_42	AC	205 ms 31,480 KB
testcase_43	AC	239 ms 32,416 KB
testcase_44	AC	234 ms 31,784 KB
testcase_45	AC	163 ms 26,264 KB
testcase_46	AC	75 ms 17,276 KB
testcase_47	AC	55 ms 14,256 KB
testcase_48	AC	482 ms 54,848 KB
testcase_49	AC	35 ms 11,176 KB
testcase_50	AC	19 ms 8,932 KB
testcase_51	AC	19 ms 9,048 KB
testcase_52	AC	800 ms 80,820 KB
testcase_53	AC	786 ms 80,860 KB
07_evil_01.txt	AC	1,881 ms 153,056 KB
07_evil_02.txt	TLE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

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)
        if set(ans)==set(range(1,n+1)):
            yn(1)
            print(*ans, sep="\n")
        else:
            yn(0)


if __name__ == '__main__':
    main()

yukicoder

結果

テストケース

ソースコード