#include "tree.h"
#include<bits/stdc++.h>
using namespace std;
#define MAXN 200'007
int n;
vector<int> p, w;
vector<int> v[MAXN];
int brl=0;
void init(std::vector<int> P, std::vector<int> W) {
p = P;
w = W;
n = (int)p.size();
for (int q=1;q<n;q++)
{
v[ p[q] ].push_back(q);
}
for (int q=0;q<n;q++)
{
if (v[q].size()==0) brl++;
}
}
long long query(int L, int R) {
long long ans=0;
if (1LL*brl*L<=R) ans=1LL*brl*L;
else ans=1LL*brl*L-R;
return ans;
}
# | 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... |