結果

問題 No.768 Tapris and Noel play the game on Treeone
ユーザー maspy
提出日時 2020-05-05 22:40:08
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 616 ms / 2,000 ms
コード長 1,040 bytes
コンパイル時間 250 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 50,852 KB
最終ジャッジ日時 2024-06-27 06:22:10
合計ジャッジ時間 10,102 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
m = map(int, read().split())
G = [[] for _ in range(N + 1)]
for a, b in zip(m, m):
G[a].append(b)
G[b].append(a)
root = 1
parent = [0] * (N + 1)
order = []
stack = [root]
while stack:
x = stack.pop()
order.append(x)
for y in G[x]:
if y == parent[x]:
continue
parent[y] = x
stack.append(y)
dp_v = [[0, 0] for _ in range(N + 1)]
dp_e_d = [False] * (N + 1)
for v in order[::-1]:
p = parent[v]
if dp_v[v][0] == 0:
dp_e_d[v] = True
dp_v[p][0] += 1
else:
dp_v[p][1] += 1
dp_e_u = [False] * (N + 1)
for v in order:
if v == root:
continue
p = parent[v]
dp_e_u[v] = dp_v[p][0] - (dp_e_d[v]) == 0
if dp_e_u[v]:
dp_v[v][0] += 1
else:
dp_v[v][1] += 1
win_v = [v for v in range(1, N + 1) if not dp_v[v][0]]
print(len(win_v))
if win_v:
print('\n'.join(map(str, win_v)))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0