Submission #223649


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n;
int a[100000];
int ans[100000];
vector <int> v[100000];

void dfs(int x, int y)
{
    int i;
    
    for (i = 0; i < v[x].size(); i++) {
        if (v[x][i] == y) continue;
        
        dfs(v[x][i], x);
        
        a[x] += a[v[x][i]];
        ans[x] = max(ans[x], a[v[x][i]]);
    }
    
    a[x]++;
    ans[x] = max(ans[x], n - a[x]);
}

int main()
{
    int i;
    
    scanf("%d", &n);
    
    for (i = 0; i < n - 1; i++) {
        int x;
        
        scanf("%d", &x);
        
        v[i + 1].push_back(x);
        v[x].push_back(i + 1);
    }
    
    dfs(0, -1);
    
    for (i = 0; i < n; i++) printf("%d\n", ans[i]);
    
    return 0;
}

Submission Info

Submission Time
Task C - 高橋王国の分割統治
User kawatea
Language C++ (G++ 4.6.4)
Score 100
Code Size 799 Byte
Status AC
Exec Time 100 ms
Memory 15396 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:38:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 11
AC × 16
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 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 26 ms 3224 KB
sample_02.txt AC 26 ms 3108 KB
subtask1_01.txt AC 28 ms 3232 KB
subtask1_02.txt AC 28 ms 3012 KB
subtask1_03.txt AC 26 ms 3104 KB
subtask1_04.txt AC 26 ms 3112 KB
subtask1_05.txt AC 26 ms 3116 KB
subtask1_06.txt AC 26 ms 3108 KB
subtask1_07.txt AC 27 ms 3228 KB
subtask1_08.txt AC 27 ms 3108 KB
subtask1_09.txt AC 27 ms 3228 KB
subtask2_01.txt AC 78 ms 6436 KB
subtask2_02.txt AC 87 ms 7256 KB
subtask2_03.txt AC 94 ms 7636 KB
subtask2_04.txt AC 93 ms 7716 KB
subtask2_05.txt AC 74 ms 7968 KB
subtask2_06.txt AC 77 ms 8096 KB
subtask2_07.txt AC 100 ms 15396 KB