Submission #1676069


Source Code Expand

#include<stdio.h>
int MAX(int a,int b){return a<b?b:a;}
int main(){
	int n,i,p[100010],c[100010],m[100010]={};
	int d[100010]={};
	scanf("%d",&n);
	p[0]=0;
	for(i=1;i<n;i++)scanf("%d",&p[i]);
	for(i=n;i--;){
		c[i]++;
		d[i]=MAX(m[i],n-c[i]);
		m[p[i]]=MAX(m[p[i]],c[i]);
		c[p[i]]+=c[i];
	}
	for(i=0;i<n;i++)printf("%d\n",d[i]);
	return 0;
}

Submission Info

Submission Time
Task C - 高橋王国の分割統治
User yuiop
Language C (GCC 5.4.1)
Score 100
Code Size 358 Byte
Status AC
Exec Time 20 ms
Memory 2304 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:6:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ^
./Main.c:8:18: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<n;i++)scanf("%d",&p[i]);
                  ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 11
AC × 18
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
Subtask2 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 896 KB
sample_02.txt AC 1 ms 896 KB
subtask1_01.txt AC 1 ms 896 KB
subtask1_02.txt AC 1 ms 896 KB
subtask1_03.txt AC 1 ms 896 KB
subtask1_04.txt AC 1 ms 896 KB
subtask1_05.txt AC 1 ms 896 KB
subtask1_06.txt AC 1 ms 1024 KB
subtask1_07.txt AC 1 ms 896 KB
subtask1_08.txt AC 1 ms 896 KB
subtask1_09.txt AC 1 ms 896 KB
subtask2_01.txt AC 14 ms 1920 KB
subtask2_02.txt AC 18 ms 2176 KB
subtask2_03.txt AC 20 ms 2304 KB
subtask2_04.txt AC 19 ms 2304 KB
subtask2_05.txt AC 17 ms 2304 KB
subtask2_06.txt AC 17 ms 2304 KB
subtask2_07.txt AC 19 ms 2304 KB