Submission #1438447
Source Code Expand
#include <iostream> #include <map> #include <vector> #include <cstring> #include <utility> #include <algorithm> #include <cstdio> #include <queue> #include <string> #include <stack> #include <set> #include <deque> #define mp make_pair using namespace std; int n,a[100005],maxi,in[100005],v[100005]; vector <int> ve[100005]; map <int,int> ma; int main(){ cin>>n; v[100002]=-1; for (int i=2;i<=n;i++){ cin>>a[i]; in[a[i]]++; } queue <int> que; for (int i=1;i<=n;i++){ if (in[i]==0) que.push(i); if (in[i]==0) ve[i].push_back(-1); } while (!que.empty()){ int p=que.front(); que.pop(); ma.clear(); maxi=0; for (int i=0;i<ve[p].size();i++) ma[ve[p][i]]++; for (map<int,int>::iterator it=ma.begin();it!=ma.end();it++){ maxi=max(maxi,it->second+it->first); } v[p]=maxi; in[a[p]]--; if (in[a[p]]==0) que.push(a[p]); ve[a[p]].push_back(v[p]); } cout<<v[1]; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | zhukyLG |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 952 Byte |
Status | WA |
Exec Time | 56 ms |
Memory | 7680 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 800 | ||||||
Status |
|
|
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 | 52 ms | 7040 KB |
02.txt | WA | 52 ms | 7040 KB |
03.txt | WA | 54 ms | 7040 KB |
04.txt | AC | 51 ms | 7040 KB |
05.txt | AC | 53 ms | 6912 KB |
06.txt | WA | 51 ms | 7040 KB |
07.txt | AC | 55 ms | 7040 KB |
08.txt | WA | 54 ms | 7040 KB |
09.txt | WA | 56 ms | 7040 KB |
10.txt | WA | 52 ms | 7040 KB |
11.txt | AC | 41 ms | 6912 KB |
12.txt | AC | 45 ms | 6912 KB |
13.txt | AC | 47 ms | 6912 KB |
14.txt | AC | 47 ms | 6912 KB |
15.txt | WA | 48 ms | 6912 KB |
16.txt | AC | 48 ms | 6912 KB |
17.txt | WA | 49 ms | 6912 KB |
18.txt | WA | 50 ms | 6912 KB |
19.txt | WA | 52 ms | 6912 KB |
20.txt | WA | 52 ms | 6912 KB |
21.txt | AC | 30 ms | 7420 KB |
22.txt | AC | 30 ms | 7380 KB |
23.txt | AC | 30 ms | 7552 KB |
24.txt | AC | 31 ms | 7680 KB |
25.txt | WA | 31 ms | 7424 KB |
26.txt | AC | 32 ms | 7424 KB |
27.txt | AC | 33 ms | 7424 KB |
28.txt | AC | 33 ms | 7424 KB |
29.txt | AC | 36 ms | 7552 KB |
30.txt | AC | 37 ms | 7168 KB |
31.txt | AC | 43 ms | 6656 KB |
32.txt | AC | 44 ms | 6656 KB |
33.txt | AC | 43 ms | 6656 KB |
34.txt | AC | 42 ms | 6784 KB |
35.txt | WA | 41 ms | 7168 KB |
36.txt | WA | 39 ms | 6912 KB |
37.txt | AC | 39 ms | 6912 KB |
38.txt | AC | 36 ms | 7040 KB |
39.txt | AC | 35 ms | 7424 KB |
40.txt | AC | 33 ms | 7296 KB |
41.txt | AC | 2 ms | 2560 KB |
42.txt | AC | 2 ms | 2560 KB |
43.txt | AC | 2 ms | 2560 KB |
44.txt | AC | 2 ms | 2560 KB |
45.txt | AC | 2 ms | 2560 KB |
46.txt | AC | 2 ms | 2560 KB |
47.txt | AC | 2 ms | 2560 KB |
48.txt | AC | 2 ms | 2560 KB |
49.txt | AC | 2 ms | 2560 KB |
50.txt | AC | 2 ms | 2560 KB |
s1.txt | AC | 2 ms | 2560 KB |
s2.txt | AC | 2 ms | 2560 KB |
s3.txt | AC | 2 ms | 2560 KB |