Submission #1363132

#	Time	Username	Problem	Language	Result	Execution time	Memory
1363132		activedeltorre	Tree (IOI24_tree)	C++20	0 / 100	2097 ms	23548 KiB

tree

#include "tree.h"
#include <cassert>
#include <cstdio>
#include <vector>

using namespace std;
int n;
std::vector<int> p, w;
vector<int>adj[200005];
long long dim[200005];
long long dfs(int curr,int L,int R)
{
    dim[curr]=0;
    if(adj[curr].size()==0)
    {
        dim[curr]=L;
        return L*w[curr];
    }
    long long cost=0;
    for(auto k:adj[curr])
    {
        cost+=dfs(k,L,R);
        dim[curr]+=dim[k];
    }
    if(dim[curr]>R)
    {
        long long diff=dim[curr]-R;
        dim[curr]=R;
        cost+=diff*w[curr];
    }
    return cost;
}
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++)
    {
        adj[P[i]].push_back(i);
    }
}

long long query(int L, int R)
{
    return dfs(0,L,R);
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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