# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176041 | hy_1 | Tree (IOI24_tree) | C++20 | 0 ms | 0 KiB |
#include "tree.h"
#include <bitstdc++.h>
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();
}
long long query(int L, int R) {
// return n * (long long)(R - L);
return 0;
}