結果
問題 | No.1424 Ultrapalindrome |
ユーザー | ansain |
提出日時 | 2021-03-12 21:41:47 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,138 bytes |
コンパイル時間 | 114 ms |
コンパイル使用メモリ | 12,544 KB |
実行使用メモリ | 35,200 KB |
最終ジャッジ日時 | 2024-10-14 11:58:26 |
合計ジャッジ時間 | 6,367 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,880 KB |
testcase_01 | AC | 32 ms
10,880 KB |
testcase_02 | WA | - |
testcase_03 | RE | - |
testcase_04 | AC | 31 ms
10,752 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 32 ms
10,880 KB |
testcase_08 | AC | 32 ms
10,880 KB |
testcase_09 | AC | 346 ms
25,088 KB |
testcase_10 | AC | 335 ms
25,088 KB |
testcase_11 | AC | 237 ms
20,992 KB |
testcase_12 | AC | 316 ms
24,192 KB |
testcase_13 | AC | 93 ms
14,720 KB |
testcase_14 | AC | 253 ms
21,760 KB |
testcase_15 | AC | 32 ms
10,752 KB |
testcase_16 | AC | 199 ms
19,584 KB |
testcase_17 | AC | 240 ms
21,248 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 49 ms
12,288 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 425 ms
29,440 KB |
testcase_28 | WA | - |
testcase_29 | AC | 281 ms
35,200 KB |
testcase_30 | AC | 267 ms
27,136 KB |
testcase_31 | AC | 277 ms
30,336 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 #import scipy.optimize as optimize #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()) 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+1) for i in range(n): if len(graph[i])>1: root=i break 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) dist2 = [-1] * (n+1) md=dist.index(max(dist)) dist2[md] = 0 d = deque() d.append(md) while d: v = d.popleft() for i in graph[v]: if dist2[i] != -1: continue dist2[i] = dist2[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 or max(dist2)==1) if __name__ == '__main__': main()