| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345723 | thesentro | Tree (IOI24_tree) | C++20 | 0 ms | 0 KiB |
#include "tree.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
std::vector<int> p, w;
void init(std::vector<int> P, std::vector<int> W) {
p = P;
w = W;
n = (int)p.size();
for (int i=1 ; i<n ; i++)
{
g[i].push_back(p[i]);
g[p[i]].push_back(i);
}
}
long long query(int L, int R) {
return L;
}
