AtCoder Grand Contest 009

Submission #1591929

Source codeソースコード

#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

Task問題 B - Tournament
User nameユーザ名 vjudge3
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 1448 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Compiler messageコンパイルメッセージ

./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]);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - s1.txt,s2.txt,s3.txt
All 0 / 800 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01.txt WA
02.txt WA
03.txt WA
04.txt WA
05.txt WA
06.txt WA
07.txt AC 36 ms 6268 KB
08.txt WA
09.txt WA
10.txt WA
11.txt AC 20 ms 6912 KB
12.txt AC 24 ms 6592 KB
13.txt AC 26 ms 6464 KB
14.txt WA
15.txt WA
16.txt AC 30 ms 6652 KB
17.txt WA
18.txt WA
19.txt WA
20.txt WA
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
26.txt AC 24 ms 5928 KB
27.txt AC 25 ms 5904 KB
28.txt WA
29.txt WA
30.txt AC 27 ms 6008 KB
31.txt WA
32.txt WA
33.txt WA
34.txt WA
35.txt WA
36.txt WA
37.txt WA
38.txt WA
39.txt WA
40.txt WA
41.txt WA
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
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