結果
問題 | No.1424 Ultrapalindrome |
ユーザー | mkawa2 |
提出日時 | 2021-03-12 21:55:33 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 321 ms / 2,000 ms |
コード長 | 2,868 bytes |
コンパイル時間 | 220 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 32,128 KB |
最終ジャッジ日時 | 2024-04-22 17:06:08 |
合計ジャッジ時間 | 5,903 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
11,008 KB |
testcase_01 | AC | 30 ms
11,136 KB |
testcase_02 | AC | 30 ms
11,136 KB |
testcase_03 | AC | 31 ms
11,008 KB |
testcase_04 | AC | 30 ms
11,008 KB |
testcase_05 | AC | 30 ms
11,008 KB |
testcase_06 | AC | 29 ms
11,136 KB |
testcase_07 | AC | 29 ms
11,136 KB |
testcase_08 | AC | 29 ms
11,136 KB |
testcase_09 | AC | 241 ms
24,448 KB |
testcase_10 | AC | 248 ms
24,576 KB |
testcase_11 | AC | 179 ms
20,736 KB |
testcase_12 | AC | 230 ms
23,936 KB |
testcase_13 | AC | 84 ms
14,720 KB |
testcase_14 | AC | 197 ms
21,504 KB |
testcase_15 | AC | 31 ms
11,136 KB |
testcase_16 | AC | 156 ms
19,456 KB |
testcase_17 | AC | 189 ms
20,992 KB |
testcase_18 | AC | 152 ms
17,920 KB |
testcase_19 | AC | 228 ms
21,504 KB |
testcase_20 | AC | 75 ms
13,568 KB |
testcase_21 | AC | 185 ms
20,736 KB |
testcase_22 | AC | 118 ms
16,512 KB |
testcase_23 | AC | 49 ms
12,288 KB |
testcase_24 | AC | 70 ms
13,696 KB |
testcase_25 | AC | 66 ms
13,184 KB |
testcase_26 | AC | 273 ms
23,552 KB |
testcase_27 | AC | 321 ms
28,672 KB |
testcase_28 | AC | 260 ms
28,416 KB |
testcase_29 | AC | 302 ms
32,128 KB |
testcase_30 | AC | 284 ms
27,648 KB |
testcase_31 | AC | 303 ms
30,592 KB |
ソースコード
import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 class LCA: # 頂点は0~n-1 def __init__(self, to, root=0): self.to = to self.n = len(to) self.parents = [-1] * (self.n+1) self.depth = [0] * self.n self.__dfs(root) self.max_level = max(self.depth).bit_length() self.ancestor = [self.parents]+[[-1] * (self.n+1) for _ in range(self.max_level)] row0=self.ancestor[0] for lv in range(self.max_level): row1=self.ancestor[lv+1] for u in range(self.n): row1[u]=row0[row0[u]] row0=row1 def __dfs(self, root): stack=[root] while stack: u=stack.pop() pu=self.parents[u] du=self.depth[u] for v in self.to[u]: if v==pu:continue self.parents[v]=u self.depth[v]=du+1 stack.append(v) # 最小共通祖先 def anc(self,u,v): diff=self.depth[u]-self.depth[v] if diff<0:u,v=v,u diff=abs(diff) lv=0 while diff: if diff&1:u=self.ancestor[lv][u] lv,diff=lv+1,diff>>1 if u==v:return u for lv in range(self.depth[u].bit_length()-1,-1,-1): anclv=self.ancestor[lv] if anclv[u]!=anclv[v]:u,v=anclv[u],anclv[v] return self.parents[u] n=II() if n==2: print("Yes") exit() to=[[] for _ in range(n)] deg=[0]*n for _ in range(n-1): u,v=LI1() to[u].append(v) to[v].append(u) deg[u]+=1 deg[v]+=1 def ok(): c1=deg.count(1) c2=deg.count(2) if c1==2 and c2==n-2: return True elif c1+c2==n-1: mx=max(deg) root=deg.index(mx) stack=[root] dep=[-1]*n dep[root]=0 while stack: u=stack.pop() for v in to[u]: if dep[v]!=-1:continue dep[v]=dep[u]+1 stack.append(v) d=-1 for u in range(n): if deg[u]==1: if d==-1:d=dep[u] elif dep[u]!=d:return False return True else: return False print("Yes" if ok() else "No")