AtCoder Grand Contest 009

Submission #1591896

Source codeソースコード

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

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

using namespace std;

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

Submission

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

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

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
si(n);
^
./Main.cpp:14: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 WA
08.txt WA
09.txt WA
10.txt WA
11.txt AC 12 ms 1408 KB
12.txt AC 13 ms 1664 KB
13.txt AC 13 ms 1664 KB
14.txt AC 13 ms 1664 KB
15.txt AC 13 ms 1664 KB
16.txt WA
17.txt AC 13 ms 1664 KB
18.txt AC 13 ms 1664 KB
19.txt WA
20.txt AC 13 ms 1664 KB
21.txt AC 10 ms 2176 KB
22.txt AC 11 ms 2304 KB
23.txt AC 11 ms 2176 KB
24.txt WA
25.txt AC 10 ms 2304 KB
26.txt WA
27.txt WA
28.txt WA
29.txt WA
30.txt AC 11 ms 2176 KB
31.txt WA
32.txt WA
33.txt WA
34.txt WA
35.txt AC 12 ms 2176 KB
36.txt AC 12 ms 2176 KB
37.txt WA
38.txt WA
39.txt WA
40.txt WA
41.txt AC 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 AC 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