結果
問題 | No.1424 Ultrapalindrome |
ユーザー | ansain |
提出日時 | 2021-03-12 21:53:57 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 208 ms / 2,000 ms |
コード長 | 2,115 bytes |
コンパイル時間 | 145 ms |
コンパイル使用メモリ | 10,932 KB |
実行使用メモリ | 29,068 KB |
最終ジャッジ日時 | 2023-08-04 19:00:48 |
合計ジャッジ時間 | 4,454 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
8,832 KB |
testcase_01 | AC | 18 ms
8,660 KB |
testcase_02 | AC | 19 ms
8,668 KB |
testcase_03 | AC | 20 ms
8,660 KB |
testcase_04 | AC | 18 ms
8,752 KB |
testcase_05 | AC | 18 ms
8,648 KB |
testcase_06 | AC | 17 ms
8,776 KB |
testcase_07 | AC | 18 ms
8,752 KB |
testcase_08 | AC | 19 ms
8,780 KB |
testcase_09 | AC | 157 ms
22,236 KB |
testcase_10 | AC | 157 ms
22,236 KB |
testcase_11 | AC | 109 ms
18,420 KB |
testcase_12 | AC | 138 ms
21,504 KB |
testcase_13 | AC | 52 ms
12,060 KB |
testcase_14 | AC | 123 ms
19,140 KB |
testcase_15 | AC | 18 ms
8,684 KB |
testcase_16 | AC | 94 ms
16,940 KB |
testcase_17 | AC | 119 ms
18,752 KB |
testcase_18 | AC | 100 ms
15,360 KB |
testcase_19 | AC | 138 ms
18,460 KB |
testcase_20 | AC | 49 ms
11,184 KB |
testcase_21 | AC | 115 ms
17,948 KB |
testcase_22 | AC | 80 ms
13,992 KB |
testcase_23 | AC | 31 ms
9,912 KB |
testcase_24 | AC | 44 ms
11,352 KB |
testcase_25 | AC | 40 ms
10,748 KB |
testcase_26 | AC | 181 ms
20,632 KB |
testcase_27 | AC | 201 ms
26,284 KB |
testcase_28 | AC | 167 ms
25,948 KB |
testcase_29 | AC | 206 ms
29,068 KB |
testcase_30 | AC | 189 ms
24,468 KB |
testcase_31 | AC | 208 ms
27,432 KB |
ソースコード
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 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError #numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 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) def main(): mod = 10**9+7 mod2 = 998244353 n = int(input()) if n==2: yn(True) return graph = [[] for _ in range(n)] for i in range(n-1): a, b = map(lambda x: int(x)-1, input().split()) graph[a].append(b) graph[b].append(a) dist = [-1] * n for i in range(n): if len(graph[i]) > 2: root = i for j in range(n): if len(graph[j])>2 and j!=root: yn(False) return dist[root] = 0 d = deque() d.append(root) while d: v = d.popleft() for i in graph[v]: if dist[i] != -1: continue dist[i] = dist[v] + 1 d.append(i) ans = set() for i in range(n): if len(graph[i]) == 1 and i != root: ans.add(dist[i]) yn(len(ans) == 1) return yn(True) if __name__ == '__main__': main()