Submission #1276642

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276642		avighna	Tree (IOI24_tree)	C++20	10 / 100	2095 ms	19452 KiB

tree

#include <bits/stdc++.h>

int n;
std::vector<int> p, w;
std::vector<std::vector<int>> adj;

void init(std::vector<int> P, std::vector<int> W) {
  p = P, w = W, adj.resize(n = int(p.size()));
  for (int i = 1; i < n; ++i) {
    adj[p[i]].push_back(i);
  }
}

long long query(int L, int R) {
  std::vector<int64_t> c(n);
  auto dfs = [&](auto &&self, int u) -> int64_t {
    if (adj[u].empty()) {
      return c[u] = L;
    }
    int64_t sum = 0;
    for (int &i : adj[u]) {
      sum += self(self, i);
    }
    if (sum > R) {
      c[u] = sum - R;
      sum = R;
    }
    return sum;
  };
  dfs(dfs, 0);
  int64_t ans = 0;
  for (int i = 0; i < n; ++i) {
    ans += w[i] * std::abs(c[i]);
  }
  return ans;
}

• 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