Submission #1345695

#	Time	Username	Problem	Language	Result	Execution time	Memory
1345695		thesentro	트리 (IOI24_tree)	C++20	0 / 100	2095 ms	29880 KiB

tree

#include "tree.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
std::vector<int> p, w;
ll maxi = 202020;
vector<vector<ll>>g(maxi);
vector<ll>val(maxi, 0);
ll res = 0;
void dfs(ll x, ll p, ll l, ll r)
{
    ll sum = 0;
    for (auto i:g[x])
    {
        if (i!=p)
        {
            dfs(i, x, l, r);
            sum += val[i];
        }
    }
    if (sum>r)
        val[x] = r-sum;
    if (sum<l)
        val[x] = l-sum;
    if (sum>=l and sum<=r)
        val[x] = 0;
    // cout<<x<<" "<<val[x]<<endl;
    res += abs(val[x])*w[x];
}
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++)
    {
        g[i].push_back(p[i]);
        g[p[i]].push_back(i);
    }
}

long long query(int L, int R) {
    res = 0;
    dfs(0, -1, L, R);
    return res;
}

• 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