Submission #1154439


Source Code Expand

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
typedef long long lli;
lli n;
vector<unordered_map<lli,lli> > g;
vector<bool> vs;
lli dfs(lli x,lli p){
    lli ret = 1;
    for(auto y = g[x].begin();y != g[x].end();y++){
        if(y->first != p) ret += y->second = dfs(y->first,x);
    }
    g[x][p] = n - ret;
    return ret;
}

int main(int argc, char const *argv[]) {
    cin >> n;
    g = vector<unordered_map<lli,lli> > (n);
    for(lli i = 1;i < n;i++){
        lli p;
        cin >> p;
        g[i][p] = 0;g[p][i] = 0;
    }
    for(auto y = g[0].begin();y != g[0].end();y++){
        y->second = dfs(y->first,0);
    }
    for(lli i = 0;i < n;i++){
        lli ans = 0;
        for(auto y = g[i].begin();y != g[i].end();y++){
            ans = max(ans,y->second);
        }
        cout << ans << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task C - 高橋王国の分割統治
User deoxy
Language C++14 (GCC 5.4.1)
Score 100
Code Size 929 Byte
Status AC
Exec Time 265 ms
Memory 23552 KB

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 8 ms 768 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 3 ms 384 KB
subtask1_06.txt AC 3 ms 384 KB
subtask1_07.txt AC 3 ms 384 KB
subtask1_08.txt AC 3 ms 384 KB
subtask1_09.txt AC 3 ms 512 KB
subtask2_01.txt AC 183 ms 12416 KB
subtask2_02.txt AC 229 ms 15360 KB
subtask2_03.txt AC 265 ms 16768 KB
subtask2_04.txt AC 251 ms 16768 KB
subtask2_05.txt AC 199 ms 16676 KB
subtask2_06.txt AC 228 ms 17152 KB
subtask2_07.txt AC 223 ms 23552 KB