Submission #8890785

---

Source Code Expand

#設定
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

class Graph(object):
	def __init__(self):
		self.graph = defaultdict(list)

	def __len__(self):
		return len(self.graph)

	def add_edge(self, a, b):
		self.graph[a].append(b)

	def get_nodes(self):
		return self.graph.keys()

def DFS(G, W, stock, visit, node):
	for i in G.graph[node]:
		if visit[i] != "Yes":
			visit[i] = "Yes"
			DFS(G, W, stock, visit, i)
			W[node] += W[i]
			stock[node].append(W[i])
	W[node] += 1

#処理内容
def main():
	N = int(input())
	G = Graph()
	for i in range(N - 1):
		p = int(input())
		G.add_edge(i + 1, p)
		G.add_edge(p, i + 1)

	#DFS
	W = [0] * N
	visit = ["No"] * N
	visit[0] = "Yes"
	stock = [[0] for i in range(N)]
	DFS(G, W, stock, visit, 0)

	for i in range(N):
		val1 = N - W[i]
		val2 = max(stock[i])
		ans = max(val1, val2)
		print(ans)

if __name__ == '__main__':
	main()

Submission Info

Judge Result