oj.uz

Submission #873044

# Submission time Handle Problem Language Result Execution time Memory
873044 2023-11-14T11:01:52 Z NeroZein Magic Tree (CEOI19_magictree) C++17
58 / 100
 107 ms 37780 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, 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 3 ms 9068 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9076 KB Output is correct
9 Correct 2 ms 9036 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 19228 KB Output is correct
2 Correct 31 ms 19292 KB Output is correct
3 Correct 107 ms 37780 KB Output is correct
4 Correct 55 ms 20688 KB Output is correct
5 Correct 78 ms 22352 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9080 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 38 ms 23300 KB Output is correct
5 Correct 53 ms 27220 KB Output is correct
6 Correct 49 ms 23528 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 39 ms 23376 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 3 ms 9068 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9076 KB Output is correct
9 Correct 2 ms 9036 KB Output is correct
10 Correct 51 ms 18516 KB Output is correct
11 Correct 52 ms 17492 KB Output is correct
12 Correct 34 ms 18000 KB Output is correct
13 Correct 39 ms 16084 KB Output is correct
14 Correct 34 ms 22876 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 18776 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 3 ms 9068 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9076 KB Output is correct
9 Correct 2 ms 9036 KB Output is correct
10 Correct 2 ms 9080 KB Output is correct
11 Correct 2 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 38 ms 23300 KB Output is correct
14 Correct 53 ms 27220 KB Output is correct
15 Correct 49 ms 23528 KB Output is correct
16 Correct 51 ms 18516 KB Output is correct
17 Correct 52 ms 17492 KB Output is correct
18 Correct 34 ms 18000 KB Output is correct
19 Correct 39 ms 16084 KB Output is correct
20 Correct 34 ms 22876 KB Output is correct
21 Correct 16 ms 12120 KB Output is correct
22 Correct 59 ms 19612 KB Output is correct
23 Correct 56 ms 22752 KB Output is correct
24 Correct 104 ms 31124 KB Output is correct
25 Correct 60 ms 20172 KB Output is correct
26 Correct 83 ms 21396 KB Output is correct
27 Correct 64 ms 19784 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 3 ms 9068 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9076 KB Output is correct
9 Correct 2 ms 9036 KB Output is correct
10 Correct 45 ms 19228 KB Output is correct
11 Correct 31 ms 19292 KB Output is correct
12 Correct 107 ms 37780 KB Output is correct
13 Correct 55 ms 20688 KB Output is correct
14 Correct 78 ms 22352 KB Output is correct
15 Correct 2 ms 9080 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 38 ms 23300 KB Output is correct
19 Correct 53 ms 27220 KB Output is correct
20 Correct 49 ms 23528 KB Output is correct
21 Runtime error 39 ms 23376 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -