Submission #44913379


Source Code Expand

import sys

def get():
	return int(sys.stdin.readline().rstrip())

N = get()
sys.setrecursionlimit(N + 777)

children = [[] for _ in range(N + 1)]

for i in range(2, N + 1):
	P = get()
	children[P].append(i)

ans = [0 for _ in range(N + 1)]

def calc(node):
	ans[node] = 1 + sum([calc(c) for c in children[node]])
	return ans[node]

calc(1)

print("\n".join(map(str, ans[1:])))

Submission Info

Submission Time
Task B - 部分木サイズ
User mikecat
Language Python (CPython 3.11.4)
Score 0
Code Size 401 Byte
Status RE
Exec Time 2204 ms
Memory 256332 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1
Status
AC × 2
AC × 5
RE × 2
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 1008 ms 111204 KiB
01-02.txt AC 960 ms 111208 KiB
01-03.txt RE 2204 ms 256228 KiB
01-04.txt RE 2180 ms 256332 KiB
01-05.txt AC 553 ms 108840 KiB
sample-01.txt AC 10 ms 8508 KiB
sample-02.txt AC 10 ms 8448 KiB