Submission #1184906

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184906		Luvidi	Tree (IOI24_tree)	C++20	7 / 100	51 ms	16820 KiB

tree

#include "tree.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int maxn=2e5;
vector<int> ch[maxn];
ll cl;
vector<ll> w;
int n;

void init(std::vector<int> p, std::vector<int> W) {
    n=p.size();
    for(int i:W)w.push_back(i);
    for(int i=1;i<n;i++)ch[p[i]].push_back(i);
    for(int i=0;i<n;i++)cl+=ch[i].empty();
}

long long query(int L, int R) {
    ll l=L,r=R;
    if(cl*l>r){
        return 2*cl*l-r;
    }else{
        return cl*l;
    }
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 7 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19