oj.uz

Submission #833751

# Submission time Handle Problem Language Result Execution time Memory
833751 2023-08-22T08:27:34 Z MilosMilutinovic Magic Tree (CEOI19_magictree) C++14
0 / 100
 1988 ms 1048576 KB 
/**
 *    author:  wxhtzdy
 *    created: 22.08.2023 09:39:57
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    --p;
    g[p].push_back(i);
  }
  vector<int> x(n, -1), y(n);
  for (int i = 0; i < m; i++) {
    int v, d, w;
    cin >> v >> d >> w;
    --v; 
    x[v] = d;
    y[v] = w;
  }
  vector<vector<long long>> dp(n);
  vector<vector<int>> days(n);
  vector<int> f(n);
  /* auto Insert = [&](int v, int d, int val) {
    long long s = 0;
    for (auto& p : dp[f[v]]) {
      if (p.first < d) {
        s += p.first;
        if (s > val) {
          break;
        }
      } else {
        break;
      }
    } 
    if (s <= val) {
      while (!dp[f[v]].empty() && dp[f[v]].begin()->first < d) {
        dp[f[v]].erase(dp[f[v]].begin());
      }
      dp[f[v]].emplace(d, val);
    }
  }; */
  function<void(int)> Solve = [&](int v) {
    for (int u : g[v]) {
      Solve(u);
      for (int x : days[u]) {
        days[v].push_back(x);
      }
    }         
    if (x[v] != -1) {
      days[v].push_back(x[v]);
    }
    sort(days[v].begin(), days[v].end());
    days[v].erase(unique(days[v].begin(), days[v].end()), days[v].end());
    int sz = (int) days[v].size();
    dp[v].resize(sz);
    for (int u : g[v]) {
      long long mx = 0;
      int ptr = 0;
      for (int j = 0; j < sz; j++) {
        while (ptr < (int) days[u].size() && days[v][j] >= days[u][ptr]) {
          mx = max(mx, dp[u][ptr]);
          ptr += 1;
        }
        dp[v][j] += mx;
      }
    } 
    if (x[v] != -1) {
      long long sum = 0;
      for (int i = 0; i < sz; i++) {
        sum += dp[v][i];
        if (days[v][i] == x[v]) {
          dp[v][i] = max(dp[v][i], sum + y[v]);
          break;
        }
      }
    }
  };
  Solve(0);
  cout << *max_element(dp[0].begin(), dp[0].end()) << '\n';
  return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 16084 KB Output is correct
2 Runtime error 1988 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3156 KB Output is correct
2 Incorrect 8 ms 3412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 16256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 2640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -