Submission #1074519
Source Code Expand
#include <stdio.h> #include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define uint unsigned int #define ll long long #define ull unsigned long long #define ld long double #define rep(i, l, r) for (int i = l; i < r; i++) #define repb(i, r, l) for (int i = r; i > l; i--) #define sz(a) (int)a.size() #define fi first #define se second using namespace std; //using namespace __gnu_pbds; //typedef tree<int, nuint_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; const int N = 100000; const int inf = (int)1e9 + 1; const ll big = (ll)1e18 + 1; const int P = 31; const int MOD = (int)1e9 + 7; const int MOD1 = (int)1e9 + 9; const int MAX_int = (1 << 31) - 1; const double eps = 1e-6; const double pi = atan2(0, -1); vector<vector<int> > g; int dfs(int u) { if (sz(g[u]) == 0) return 0; vector<int> s; for (int v : g[u]) { int x = dfs(v); s.push_back(x); } sort(s.begin(), s.end()); rep(i, 1, sz(s)) s[i] = max(s[i], s[i - 1] + 1); return s[sz(s) - 1] + 1; } int main() { //freopen("a.in", "r", stdin); //freopen("battleship.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.precision(20); //int TL = 0.95 * CLOCKS_PER_SEC; //clock_t time = clock(); int n; cin >> n; g.resize(n); rep(i, 1, n) { int x; cin >> x; x--; g[x].push_back(i); } cout << dfs(0); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | Ping_Pong |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1595 Byte |
Status | AC |
Exec Time | 35 ms |
Memory | 13568 KB |
Compile Error
./Main.cpp:27:31: warning: integer overflow in expression [-Woverflow] const int MAX_int = (1 << 31) - 1; ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 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 | AC | 29 ms | 4224 KB |
02.txt | AC | 29 ms | 4224 KB |
03.txt | AC | 29 ms | 4224 KB |
04.txt | AC | 29 ms | 4224 KB |
05.txt | AC | 30 ms | 4224 KB |
06.txt | AC | 29 ms | 4224 KB |
07.txt | AC | 29 ms | 4224 KB |
08.txt | AC | 29 ms | 4224 KB |
09.txt | AC | 30 ms | 4224 KB |
10.txt | AC | 29 ms | 4224 KB |
11.txt | AC | 35 ms | 13568 KB |
12.txt | AC | 34 ms | 10624 KB |
13.txt | AC | 33 ms | 9216 KB |
14.txt | AC | 31 ms | 7680 KB |
15.txt | AC | 29 ms | 6656 KB |
16.txt | AC | 29 ms | 5760 KB |
17.txt | AC | 28 ms | 5120 KB |
18.txt | AC | 28 ms | 4736 KB |
19.txt | AC | 29 ms | 4608 KB |
20.txt | AC | 29 ms | 4608 KB |
21.txt | AC | 15 ms | 3704 KB |
22.txt | AC | 15 ms | 3424 KB |
23.txt | AC | 15 ms | 3444 KB |
24.txt | AC | 15 ms | 3376 KB |
25.txt | AC | 14 ms | 3200 KB |
26.txt | AC | 14 ms | 3200 KB |
27.txt | AC | 14 ms | 3200 KB |
28.txt | AC | 14 ms | 3200 KB |
29.txt | AC | 15 ms | 3200 KB |
30.txt | AC | 16 ms | 3200 KB |
31.txt | AC | 24 ms | 4224 KB |
32.txt | AC | 24 ms | 3584 KB |
33.txt | AC | 21 ms | 3328 KB |
34.txt | AC | 21 ms | 3328 KB |
35.txt | AC | 20 ms | 3456 KB |
36.txt | AC | 17 ms | 3072 KB |
37.txt | AC | 17 ms | 3072 KB |
38.txt | AC | 15 ms | 3072 KB |
39.txt | AC | 14 ms | 3072 KB |
40.txt | AC | 13 ms | 3072 KB |
41.txt | AC | 3 ms | 256 KB |
42.txt | AC | 3 ms | 384 KB |
43.txt | AC | 3 ms | 256 KB |
44.txt | AC | 3 ms | 256 KB |
45.txt | AC | 3 ms | 256 KB |
46.txt | AC | 3 ms | 256 KB |
47.txt | AC | 3 ms | 256 KB |
48.txt | AC | 3 ms | 256 KB |
49.txt | AC | 3 ms | 256 KB |
50.txt | AC | 3 ms | 256 KB |
s1.txt | AC | 3 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |
s3.txt | AC | 3 ms | 256 KB |