Submission #1695722
Source Code Expand
#include <stdio.h> #include <stdlib.h> int max(int a, int b){ return a >= b ? a : b; } int main(){ int N, i; scanf("%d", &N); int *p = (int *)malloc(sizeof(int) * N); for(i = 1; i < N; i++){ scanf("%d", &p[i]); } int *max_set = (int *)calloc(N, sizeof(int)); int *descendants_num = (int *)calloc(N, sizeof(int)); for(i = N - 1; i > 0; i--){ max_set[p[i]] = max(max_set[p[i]], descendants_num[i] + 1); descendants_num[p[i]] += descendants_num[i] + 1; } printf("%d\n", max_set[0]); for(i = 1; i < N; i++){ printf("%d\n", max(max_set[i], N - descendants_num[i] - 1)); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋王国の分割統治 |
User | abc050 |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 627 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1920 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:10:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.c:13:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &p[i]); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
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 | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
subtask1_01.txt | AC | 1 ms | 128 KB |
subtask1_02.txt | AC | 1 ms | 128 KB |
subtask1_03.txt | AC | 1 ms | 128 KB |
subtask1_04.txt | AC | 1 ms | 128 KB |
subtask1_05.txt | AC | 1 ms | 128 KB |
subtask1_06.txt | AC | 1 ms | 128 KB |
subtask1_07.txt | AC | 1 ms | 128 KB |
subtask1_08.txt | AC | 1 ms | 128 KB |
subtask1_09.txt | AC | 1 ms | 128 KB |
subtask2_01.txt | AC | 14 ms | 1408 KB |
subtask2_02.txt | AC | 18 ms | 1792 KB |
subtask2_03.txt | AC | 19 ms | 1920 KB |
subtask2_04.txt | AC | 19 ms | 1920 KB |
subtask2_05.txt | AC | 17 ms | 1152 KB |
subtask2_06.txt | AC | 17 ms | 1152 KB |
subtask2_07.txt | AC | 19 ms | 1920 KB |