Submission #1217507

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217507		dosts	Tree (IOI24_tree)	C++20	0 / 100	2098 ms	42308 KiB

tree

#include "tree.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9,N = 2e5+1;
int n;
vector<int> p, w;
vi edges[N];
pii dp[N];
int L,R;
void dfs(int node){ 
  dp[node] = {0,0};
  for (auto it : edges[node]) {
    dfs(it);
    dp[node].ff+=dp[it].ff;
    dp[node].ss+=dp[it].ss;
  }
  if (dp[node].ss > R) {
    dp[node].ff+=w[node]*abs(dp[node].ss-R);
    dp[node].ss = R;
  }else if (dp[node].ss < L) dp[node].ff+=w[node]*abs(L-dp[node].ss),dp[node].ss = L;
  cerr << node sp dp[node].ff sp dp[node].ss << '\n';
}

void init(vector<signed> P, vector<signed> W) {
  p = vi(all(P));
  w = vi(all(W));
  n = (int)p.size();
  for (int i=1;i<n;i++) {
    edges[p[i]].push_back(i);
  }
}

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

• 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