| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1349647 | ahmetlbktd4 | Tree (IOI24_tree) | C++20 | 37 ms | 16832 KiB |
#include "tree.h"
#include "bits/stdc++.h"
#define ll long long
using namespace std;
const int N = 2e5+5;
int n;
vector<int> p, w;
int k = 0;
vector <vector<int>> g;
int d[N];
void init(std::vector<int> P, std::vector<int> W){
p = P;
w = W;
n = (int)p.size();
g.resize(n);
for (int i = 1;i < n;i++){
g[p[i]].push_back(i);
}
// dfs(0,-1);
for (int i = 0;i < n;i++){
if (g[i].empty())
k++;
}
}
ll query(int L, int R){
ll p = (ll)k*L + (ll)max(0ll,(ll)k*L-R);
return p;
}
| # | 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... | ||||
