Submission #646268

#	Time	Username	Problem	Language	Result	Execution time	Memory
646268		Pety	Magic Tree (CEOI19_magictree)	C++14	55 / 100	136 ms	36296 KiB

magictree

#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int INF = 1e9;
const int MOD = 1e9 + 9;

int n, m, w[100002], d[100002], k;
vector<int>G[100002];
map<int, ll>aib[100002];



void dfs (int nod) {
  for (auto it : G[nod]) {
    dfs(it);
    if (aib[nod].size() < aib[it].size())
      swap(aib[nod], aib[it]);
    for (auto it2 : aib[it])
      aib[nod][it2.first] += it2.second;
  }
  if (w[nod]) {
    aib[nod][d[nod]] += w[nod]; 
    while (1) {
      auto it = aib[nod].upper_bound(d[nod]);
      if (it == aib[nod].end())
        break;
      if (it->second < w[nod])
        aib[nod].erase(it);
      else {
        it->second -= w[nod];
        break;
      }
    }
  }
}


int main () 
{
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> k;
  for (int i = 2; i <= n; i++) {
    int x;
    cin >> x;
    G[x].push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    int v;
    cin >> v;
    cin >> d[v] >> w[v];
  }
  dfs(1);
  int ans = 0;
  for (auto it : aib[1])
    ans += it.second;
  cout << ans;
  return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 3
• Subtask 3: 11 / 11
• Subtask 4: 0 / 12
• Subtask 5: 16 / 16
• Subtask 6: 0 / 13
• Subtask 7: 22 / 22
• Subtask 8: 0 / 17