Submission #1242030

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242030		SalihSahin	Tree (IOI24_tree)	C++20	0 / 100	2089 ms	23292 KiB

tree

#include "bits/stdc++.h"
#include "tree.h"
using namespace std;
#define pb push_back


int n;
vector<int> p, w, order;
vector<vector<int> > ch;

void dfs(int node){
  for(auto itr: ch[node]){
    dfs(itr);
  }
  order.pb(node);
}

void init(vector<int> P, vector<int> W) {
  p = P;
  w = W;
  n = (int)p.size();

  ch.resize(n);
  for(int i = 1; i < n; i++){
    ch[P[i]].pb(i);
  }

  dfs(0);
}

long long query(int L, int R){
  vector<long long> c(n), sub(n);

  for(int i = 0; i < n; i++){
    int node = order[i];

    for(auto itr: ch[node]){
      sub[node] += sub[itr];
    }

    if(sub[node] > R || sub[node] < L){
       if(sub[node] > R) c[node] = sub[node] - R;
       else c[node] = L - sub[node];
    }
    sub[node] += c[node];
  }

  long long ans = 0;
  for(int i = 0; i < n; i++){
    ans += c[i];
  }
  return ans;
}

• 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