結果
問題 | No.1640 簡単な色塗り |
ユーザー | ansain |
提出日時 | 2021-08-06 22:08:50 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,623 bytes |
コンパイル時間 | 189 ms |
コンパイル使用メモリ | 11,160 KB |
実行使用メモリ | 69,540 KB |
最終ジャッジ日時 | 2023-09-12 02:06:06 |
合計ジャッジ時間 | 31,084 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
8,876 KB |
testcase_01 | AC | 21 ms
8,888 KB |
testcase_02 | AC | 21 ms
9,024 KB |
testcase_03 | AC | 20 ms
8,944 KB |
testcase_04 | AC | 332 ms
45,012 KB |
testcase_05 | AC | 520 ms
69,540 KB |
testcase_06 | AC | 21 ms
8,936 KB |
testcase_07 | AC | 21 ms
8,888 KB |
testcase_08 | AC | 20 ms
8,872 KB |
testcase_09 | WA | - |
testcase_10 | AC | 447 ms
43,588 KB |
testcase_11 | AC | 372 ms
36,268 KB |
testcase_12 | AC | 302 ms
33,732 KB |
testcase_13 | AC | 729 ms
61,476 KB |
testcase_14 | AC | 712 ms
61,688 KB |
testcase_15 | AC | 220 ms
26,760 KB |
testcase_16 | AC | 265 ms
30,464 KB |
testcase_17 | AC | 627 ms
52,652 KB |
testcase_18 | AC | 53 ms
12,880 KB |
testcase_19 | AC | 310 ms
33,068 KB |
testcase_20 | AC | 436 ms
41,760 KB |
testcase_21 | AC | 366 ms
35,648 KB |
testcase_22 | AC | 41 ms
11,504 KB |
testcase_23 | AC | 468 ms
44,356 KB |
testcase_24 | AC | 113 ms
18,968 KB |
testcase_25 | AC | 304 ms
33,488 KB |
testcase_26 | AC | 521 ms
47,952 KB |
testcase_27 | AC | 216 ms
25,972 KB |
testcase_28 | AC | 700 ms
59,672 KB |
testcase_29 | AC | 505 ms
48,056 KB |
testcase_30 | AC | 81 ms
16,296 KB |
testcase_31 | AC | 675 ms
58,496 KB |
testcase_32 | AC | 548 ms
52,320 KB |
testcase_33 | AC | 350 ms
38,244 KB |
testcase_34 | AC | 483 ms
45,680 KB |
testcase_35 | AC | 344 ms
38,272 KB |
testcase_36 | AC | 82 ms
16,396 KB |
testcase_37 | AC | 107 ms
19,280 KB |
testcase_38 | AC | 575 ms
54,156 KB |
testcase_39 | AC | 202 ms
28,408 KB |
testcase_40 | AC | 215 ms
28,804 KB |
testcase_41 | AC | 499 ms
46,528 KB |
testcase_42 | AC | 242 ms
31,704 KB |
testcase_43 | AC | 287 ms
32,152 KB |
testcase_44 | AC | 278 ms
31,668 KB |
testcase_45 | AC | 191 ms
26,112 KB |
testcase_46 | AC | 86 ms
17,228 KB |
testcase_47 | AC | 61 ms
14,032 KB |
testcase_48 | AC | 572 ms
54,924 KB |
testcase_49 | AC | 38 ms
11,100 KB |
testcase_50 | AC | 20 ms
8,940 KB |
testcase_51 | AC | 20 ms
8,940 KB |
testcase_52 | AC | 898 ms
69,104 KB |
testcase_53 | AC | 883 ms
69,256 KB |
07_evil_01.txt | TLE | - |
07_evil_02.txt | TLE | - |
ソースコード
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()