# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442401 | koioi.org-koosaga | Counterspells (CPSPC17_counterspells) | C++17 | 1084 ms | 3780 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 200005;
const int mod = 1e9 + 7;
int n, p[MAXN], dep[MAXN];
int val[MAXN], cnt[MAXN];
int main(){
scanf("%d",&n);
p[0] = -1;
for(int i = 1; i <= n; i++){
scanf("%d",&p[i]);
dep[i] = dep[p[i]] + 1;
if(dep[i] % 2) cnt[i]++;
}
for(int i = 1; i <= n; i++){
val[i] = dep[i] % 2;
int ans = 0;
if(dep[i] % 2){
int j = i;
while(~p[j] && cnt[p[j]] == 0){
j = p[j];
cnt[j]++;
ans++;
}
if(~p[j]) cnt[p[j]]++;
}
else{
int j = i;
while(~p[j] && cnt[p[j]] == 1){
j = p[j];
cnt[j]--;
ans++;
}
if(~p[j]) cnt[p[j]]--;
}
printf("%d\n", ans);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |