Submission #1367889

#	Time	Username	Problem	Language	Result	Execution time	Memory
1367889		Almonther	Tree (IOI24_tree)	C++20	10 / 100	2094 ms	6536 KiB

tree

#include<bits/stdc++.h>

using namespace std;

#define ll long long
vector<int>par,wei;
ll n;
void init(std::vector<int> P, std::vector<int> W){
    par=P,wei=W;
    n=par.size();
}
long long query(int L, int R){
    vector<ll>val(n+5,0);
    ll ans=0;
    for(int i=n-1;i>=0;i--){
        ll x=val[i];
        if(x>R) ans+=(x-R)*wei[i],val[i]=R;
        else if(x<L) ans+=(L-x)*wei[i],val[i]=L;
        if(i) val[par[i]]+=val[i];
    }
    return ans;
}
// int main(){
//     init({-1, 0, 0}, {1, 1, 1});
//     cout<<query(1, 1)<<' '<<query(1, 2)<<'\n';
// }

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