結果
問題 | No.1424 Ultrapalindrome |
ユーザー | nephrologist |
提出日時 | 2021-03-12 22:00:57 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,264 bytes |
コンパイル時間 | 469 ms |
コンパイル使用メモリ | 82,828 KB |
実行使用メモリ | 101,888 KB |
最終ジャッジ日時 | 2024-04-22 12:57:50 |
合計ジャッジ時間 | 5,112 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
53,376 KB |
testcase_01 | AC | 42 ms
54,016 KB |
testcase_02 | AC | 42 ms
53,760 KB |
testcase_03 | AC | 41 ms
53,504 KB |
testcase_04 | AC | 42 ms
53,376 KB |
testcase_05 | AC | 42 ms
53,888 KB |
testcase_06 | AC | 43 ms
54,016 KB |
testcase_07 | AC | 43 ms
53,760 KB |
testcase_08 | WA | - |
testcase_09 | AC | 177 ms
89,856 KB |
testcase_10 | AC | 180 ms
89,728 KB |
testcase_11 | AC | 132 ms
83,840 KB |
testcase_12 | AC | 159 ms
89,008 KB |
testcase_13 | AC | 97 ms
79,232 KB |
testcase_14 | AC | 138 ms
84,864 KB |
testcase_15 | AC | 44 ms
54,272 KB |
testcase_16 | AC | 118 ms
83,200 KB |
testcase_17 | AC | 136 ms
84,768 KB |
testcase_18 | AC | 131 ms
82,176 KB |
testcase_19 | AC | 173 ms
85,632 KB |
testcase_20 | AC | 95 ms
78,592 KB |
testcase_21 | AC | 148 ms
83,200 KB |
testcase_22 | AC | 128 ms
81,280 KB |
testcase_23 | AC | 70 ms
73,216 KB |
testcase_24 | AC | 91 ms
78,464 KB |
testcase_25 | AC | 92 ms
78,576 KB |
testcase_26 | AC | 197 ms
87,096 KB |
testcase_27 | WA | - |
testcase_28 | AC | 116 ms
91,392 KB |
testcase_29 | AC | 114 ms
91,264 KB |
testcase_30 | AC | 131 ms
101,888 KB |
testcase_31 | AC | 122 ms
101,760 KB |
ソースコード
import sys from collections import deque input = sys.stdin.buffer.readline n = int(input()) graph = [[] for _ in range(n)] deg1 = [0] * n deg2 = [0] * n for _ in range(n - 1): a, b = map(int, input().split()) a, b = a - 1, b - 1 graph[a].append(b) graph[b].append(a) deg1[a] += 1 deg1[b] += 1 root = -1 kouho = deque() haji = [] dist1 = [-1] * n done = [0] * n for i in range(n): if deg1[i] != 1: root = i if deg1[i] == 1: haji.append(i) def ok(): print("Yes") exit() def ng(): print("No") exit() if root == -1: if n == 2: ok() else: ng() # bfs # print("kouho", kouho) v = haji[0] dist1[v] = 0 kouho.append(v) while kouho: v = kouho.popleft() d = dist1[v] for u in graph[v]: if dist1[u] == -1: dist1[u] = d + 1 kouho.append(u) temp = dist1[haji[1]] for v in haji[1:]: if dist1[v] != temp: ng() dist2 = [-1] * n v = haji[-1] dist2[v] = 0 kouho.append(v) while kouho: v = kouho.popleft() d = dist2[v] for u in graph[v]: if dist2[u] == -1: dist2[u] = d + 1 kouho.append(u) temp = dist2[haji[0]] for v in haji[:-1]: if dist2[v] != temp: ng() ok()