# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168313 | 2019-12-12T11:23:19 Z | aydinenes | Birokracija (COCI18_birokracija) | C++11 | 248 ms | 37596 KB |
#include<bits/stdc++.h> #define mid(l,r) ((l+r)/2) using namespace std; const int N = 1e6 + 7; const int inf = 1e9 + 7; int n; int a[N]; vector<int> g[N]; int ans[N]; void dfsa(int node, int p){ ans[node] = 1; for(int i = 0; i < g[node].size(); i++){ int x = g[node][i]; if(x == p) continue; dfsa(x, node); ans[node] += ans[x]; } } void dfsb(int node, int p){ for(int i = 0; i < g[node].size(); i++){ int x = g[node][i]; if(x == p) continue; dfsb(x, node); ans[node] += ans[x]; } } int main(){ cin >> n; for(int i = 2; i <= n; i++){ cin >> a[i]; g[i].push_back(a[i]); g[a[i]].push_back(i); } dfsa(1, 0); dfsb(1, 0); for(int i=1; i <= n; i++){ cout << ans[i] << " "; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 23800 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 23800 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 23892 KB | Output is correct |
2 | Correct | 23 ms | 23800 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 23800 KB | Output is correct |
2 | Correct | 23 ms | 23928 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 23772 KB | Output is correct |
2 | Correct | 24 ms | 23848 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 40 ms | 24608 KB | Output is correct |
2 | Correct | 43 ms | 24952 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 93 ms | 26872 KB | Output is correct |
2 | Correct | 82 ms | 26972 KB | Output is correct |
3 | Correct | 84 ms | 28024 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 248 ms | 32252 KB | Output is correct |
2 | Incorrect | 198 ms | 34120 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 246 ms | 32392 KB | Output is correct |
2 | Correct | 197 ms | 32888 KB | Output is correct |
3 | Incorrect | 195 ms | 35336 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 238 ms | 32260 KB | Output is correct |
2 | Correct | 194 ms | 33184 KB | Output is correct |
3 | Incorrect | 190 ms | 37596 KB | Output isn't correct |