Submission #1242486

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242486		mychecksedad	트리 (IOI24_tree)	C++20	10 / 100	2094 ms	24300 KiB

tree

#include "tree.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define ll long long int
const int N = 2e5+100;

int n;
std::vector<int> p, w;
vi g[N];
ll dp[N], sum[N];
ll L, R;  
void dfs(int v){
  sum[v] = 0;
  dp[v] = 0;
  for(int u: g[v]){
    dfs(u);
    dp[v] += dp[u];
    sum[v] += sum[u];
  }
  if(sum[v] < L){
    dp[v] += (L-sum[v]) * w[v];
    sum[v] = L;
  }else if(sum[v] <= R){
    // nothing
  }else{
    dp[v] += abs(R-sum[v])*w[v]; 
    sum[v] = R;
  }
}

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[P[i]].pb(i);
}

long long query(int l, int r) {
  L = l, R = r;
  dfs(0);
  return dp[0];
}

• 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