oj.uz

Submission #873046

# Submission time Handle Problem Language Result Execution time Memory
873046 2023-11-14T11:02:49 Z NeroZein Magic Tree (CEOI19_magictree) C++17
58 / 100
 101 ms 35412 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 1e5 + 5;

vector<int> g[N]; 
pair<int, long long> a[N]; 
map<int, long long> dp[N]; 

void merge(map<int, long long>& du, map<int, long long>& dv) {
  if (du.size() > dv.size()) {
    swap(du, dv);
  }
  for (auto it : du) {
    dv[it.first] += it.second; 
  }
}

void dfs(int v) {
  for (int u : g[v]) {
    dfs(u); 
    merge(dp[u], dp[v]); 
  }
  if (!a[v].first) return;
  long long tmp = a[v].second; 
  dp[v][a[v].first] += a[v].second; 
  auto it = dp[v].upper_bound(a[v].first);
  while (tmp && it != dp[v].end()) {
    if (tmp >= it->second) {
      tmp -= it->second;
      dp[v].erase(it); 
    } else {
      it->second -= tmp; 
      tmp = 0;
    }
  } 
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k; 
  for (int i = 2; i <= n; ++i) {
    int p;
    cin >> p;
    g[p].push_back(i); 
  }
  for (int i = 0; i < m; ++i) {
    int v, t;
    long long w;
    cin >> v >> t >> w;
    a[v] = {t, w}; 
  }
  dfs(1);
  long long ans = 0; 
  for (auto it : dp[1]) {
    ans += it.second;
  }
  cout << ans << '\n'; 
  return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9048 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 2 ms 9048 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 18272 KB Output is correct
2 Correct 29 ms 18260 KB Output is correct
3 Correct 101 ms 35412 KB Output is correct
4 Correct 59 ms 18596 KB Output is correct
5 Correct 68 ms 20052 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 36 ms 21332 KB Output is correct
5 Correct 52 ms 25428 KB Output is correct
6 Correct 47 ms 21584 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 33 ms 21176 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9048 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 2 ms 9048 KB Output is correct
10 Correct 47 ms 16948 KB Output is correct
11 Correct 42 ms 16208 KB Output is correct
12 Correct 34 ms 16208 KB Output is correct
13 Correct 26 ms 15092 KB Output is correct
14 Correct 33 ms 21340 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 18780 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9048 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 2 ms 9048 KB Output is correct
10 Correct 2 ms 9048 KB Output is correct
11 Correct 2 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 36 ms 21332 KB Output is correct
14 Correct 52 ms 25428 KB Output is correct
15 Correct 47 ms 21584 KB Output is correct
16 Correct 47 ms 16948 KB Output is correct
17 Correct 42 ms 16208 KB Output is correct
18 Correct 34 ms 16208 KB Output is correct
19 Correct 26 ms 15092 KB Output is correct
20 Correct 33 ms 21340 KB Output is correct
21 Correct 13 ms 11972 KB Output is correct
22 Correct 49 ms 18516 KB Output is correct
23 Correct 58 ms 21584 KB Output is correct
24 Correct 98 ms 29268 KB Output is correct
25 Correct 70 ms 18640 KB Output is correct
26 Correct 71 ms 19604 KB Output is correct
27 Correct 52 ms 17868 KB Output is correct

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9048 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 2 ms 9048 KB Output is correct
10 Correct 40 ms 18272 KB Output is correct
11 Correct 29 ms 18260 KB Output is correct
12 Correct 101 ms 35412 KB Output is correct
13 Correct 59 ms 18596 KB Output is correct
14 Correct 68 ms 20052 KB Output is correct
15 Correct 2 ms 9048 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 36 ms 21332 KB Output is correct
19 Correct 52 ms 25428 KB Output is correct
20 Correct 47 ms 21584 KB Output is correct
21 Runtime error 33 ms 21176 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -