Submission #1591929


Source Code Expand

#include <iostream>
#include <bits/stdc++.h>

#define si(x) scanf("%d",&x)

using namespace std;

vector<vector<int> > child;
int dfs(int node){
    if(child[node].size()==0)return 0;
    vector<int> dist;
    for(int i=0;i<child[node].size();i++){
        dist.push_back(dfs(child[node][i]));
    }
    sort(dist.begin(),dist.end());
    int ans  = 0;
    for(int i=0;i<dist.size();i++){
        ans = max(ans,dist[i])+1;
    }
    return ans;
}

int main()
{
    int n,ans = 0;
    si(n);
    vector<int> parent(n+1),score(n+1,0),last(n+1 , 0);
    child.resize(n+1);
    for(int i=2;i<=n;i++){
        si(parent[i]);
        score[parent[i]]++;
        child[parent[i]].push_back(i);
    }
    priority_queue<pair<int,pair<int,int> > >  qu;
    for(int i=2;i<score.size();i++){
        if(score[i] == 0){
            last[parent[i]] = max(last[parent[i]],last[i]) + 1;
            qu.push({-1*last[parent[i]],{i,parent[i]}});
        }
    }
    while(!qu.empty()){
        //loser,winner
        pair<int,pair<int,int> > match = qu.top();qu.pop();
        last[match.second.second] = match.first*-1;
        score[match.second.second]--;
        if(score[match.second.second] == 0){
            if(match.second.second == 1)break;
            qu.push({-1*(max(last[match.second.first],last[match.second.second])+1),{match.second.second , parent[match.second.second]}});
        }
    }
    cout << last[1];
    //cout << dfs(1);
    return 0;
}

Submission Info

Submission Time
Task B - Tournament
User vjudge3
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1448 Byte
Status WA
Exec Time 36 ms
Memory 6912 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     si(n);
          ^
./Main.cpp:30:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         si(parent[i]);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 3
AC × 23
WA × 30
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 WA 35 ms 6268 KB
02.txt WA 34 ms 6268 KB
03.txt WA 34 ms 6264 KB
04.txt WA 35 ms 6268 KB
05.txt WA 34 ms 6268 KB
06.txt WA 35 ms 6268 KB
07.txt AC 36 ms 6268 KB
08.txt WA 36 ms 6268 KB
09.txt WA 34 ms 6268 KB
10.txt WA 35 ms 6264 KB
11.txt AC 20 ms 6912 KB
12.txt AC 24 ms 6592 KB
13.txt AC 26 ms 6464 KB
14.txt WA 28 ms 6396 KB
15.txt WA 29 ms 6652 KB
16.txt AC 30 ms 6652 KB
17.txt WA 31 ms 6652 KB
18.txt WA 31 ms 6652 KB
19.txt WA 32 ms 6652 KB
20.txt WA 32 ms 6652 KB
21.txt AC 21 ms 6132 KB
22.txt AC 22 ms 5788 KB
23.txt AC 23 ms 5868 KB
24.txt AC 23 ms 5928 KB
25.txt WA 24 ms 6032 KB
26.txt AC 24 ms 5928 KB
27.txt AC 25 ms 5904 KB
28.txt WA 26 ms 6020 KB
29.txt WA 27 ms 6008 KB
30.txt AC 27 ms 6008 KB
31.txt WA 29 ms 6268 KB
32.txt WA 30 ms 6520 KB
33.txt WA 29 ms 6264 KB
34.txt WA 29 ms 6264 KB
35.txt WA 29 ms 6264 KB
36.txt WA 28 ms 5880 KB
37.txt WA 28 ms 5880 KB
38.txt WA 28 ms 5880 KB
39.txt WA 28 ms 5880 KB
40.txt WA 27 ms 5884 KB
41.txt WA 1 ms 256 KB
42.txt AC 1 ms 256 KB
43.txt AC 1 ms 256 KB
44.txt AC 1 ms 256 KB
45.txt AC 1 ms 256 KB
46.txt WA 1 ms 256 KB
47.txt AC 1 ms 256 KB
48.txt AC 1 ms 256 KB
49.txt AC 1 ms 256 KB
50.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB