Submission #2200644


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

class TreeNode{
    private:
    int idx;
    vector<TreeNode*> losers;
    public:
    int getIndex(){
        return this->idx;
    }
    vector<TreeNode*> &getLosers(){
        return this->losers;
    }
    void setIndex(const int index){
        this->idx=index;
    }
    void clearLosers(){
        this->losers.clear();
    }
    void addLoser(TreeNode *loser){
        this->losers.push_back(loser);
    }
} treeNode[110000];

int minimumHeight(TreeNode *node, unordered_map<int, int> &cache){
    unordered_map<int, int>::iterator it = cache.find(node->getIndex());
    if(it!=cache.end()){
        return it->second;
    }
    vector<int> sub;
    for(TreeNode *loser : node->getLosers()){
        sub.push_back(minimumHeight(loser, cache));
    }
    sort(sub.begin(), sub.end());
    int foo=-1;
    for(const int h : sub){
        if(foo<h){
            foo=h;
        }else{
            foo++;
        }
    }
    foo++;
    cache.insert(make_pair(node->getIndex(), foo));
    return foo;
}

int main(){
    int n;
    while(scanf("%d", &n)!=EOF){
        for(int i=0; i<n; i++){
            treeNode[i].setIndex(i);
        }
        for(int i=1; i<n; i++){
            int p;
            scanf("%d", &p);
            p--;
            treeNode[p].addLoser(&treeNode[i]);
        }
        unordered_map<int, int> cache;
        printf("%d\n", minimumHeight(&treeNode[0], cache));
    }
    return 0;
}

Submission Info

Submission Time
Task B - Tournament
User jki14
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1528 Byte
Status AC
Exec Time 50 ms
Memory 20260 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:57:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &p);
                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 53
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 46 ms 9636 KB
02.txt AC 50 ms 9636 KB
03.txt AC 46 ms 9636 KB
04.txt AC 46 ms 9636 KB
05.txt AC 47 ms 9636 KB
06.txt AC 44 ms 9636 KB
07.txt AC 45 ms 9636 KB
08.txt AC 49 ms 9636 KB
09.txt AC 46 ms 9636 KB
10.txt AC 44 ms 9636 KB
11.txt AC 39 ms 20260 KB
12.txt AC 41 ms 16420 KB
13.txt AC 39 ms 14756 KB
14.txt AC 39 ms 13092 KB
15.txt AC 38 ms 12068 KB
16.txt AC 39 ms 11044 KB
17.txt AC 39 ms 10532 KB
18.txt AC 44 ms 10148 KB
19.txt AC 45 ms 9892 KB
20.txt AC 47 ms 9892 KB
21.txt AC 23 ms 8948 KB
22.txt AC 25 ms 8716 KB
23.txt AC 25 ms 8832 KB
24.txt AC 26 ms 8688 KB
25.txt AC 28 ms 8740 KB
26.txt AC 29 ms 8740 KB
27.txt AC 30 ms 8740 KB
28.txt AC 31 ms 8740 KB
29.txt AC 35 ms 8868 KB
30.txt AC 35 ms 8868 KB
31.txt AC 35 ms 9380 KB
32.txt AC 35 ms 9380 KB
33.txt AC 32 ms 8996 KB
34.txt AC 31 ms 9124 KB
35.txt AC 32 ms 9380 KB
36.txt AC 28 ms 8612 KB
37.txt AC 27 ms 8740 KB
38.txt AC 26 ms 8868 KB
39.txt AC 25 ms 8868 KB
40.txt AC 24 ms 8612 KB
41.txt AC 3 ms 3712 KB
42.txt AC 3 ms 3712 KB
43.txt AC 3 ms 3712 KB
44.txt AC 3 ms 3712 KB
45.txt AC 3 ms 3712 KB
46.txt AC 3 ms 3712 KB
47.txt AC 3 ms 3712 KB
48.txt AC 3 ms 3712 KB
49.txt AC 3 ms 3712 KB
50.txt AC 3 ms 3712 KB
s1.txt AC 3 ms 3712 KB
s2.txt AC 3 ms 3712 KB
s3.txt AC 3 ms 3712 KB