# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1103365 | Ahmed57 | Tree (IOI24_tree) | C++17 | 50 ms | 8356 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>
using namespace std;
long long cnt = 0;
void init(std::vector<int> P, std::vector<int> W){
int deg[P.size()] = {0};
int root = -1;
for(int i = 0;i<P.size();i++){
int x = P[i];
if(x==-1){
root = x;
}else{
deg[x]++;
deg[i]++;
}
}
for(int i = 0;i<P.size();i++){
if(i==root)continue;
if(deg[i]==1)cnt++;
}
}
long long query(int L, int R){
return cnt*L+max(0ll,(cnt*L-R));
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |