oj.uz

Submission #681078

# Submission time Handle Problem Language Result Execution time Memory
681078 2023-01-12T10:33:28 Z peijar Magic Tree (CEOI19_magictree) C++17
100 / 100
 158 ms 18396 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

namespace std {
template <typename T> ostream &operator<<(ostream &out, const vector<T> &vec) {
  out << "[";
  for (int i = 0; i < (int)vec.size(); ++i) {
    out << vec[i];
    if (i + 1 < (int)vec.size())
      out << ", ";
  }
  return out << "]";
}
} // namespace std

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << H;
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbSommet, nbFruits, nbJours;
  cin >> nbSommet >> nbFruits >> nbJours;
  vector<vector<int>> childs(nbSommet);

  for (int i = 1; i < nbSommet; ++i) {
    int p;
    cin >> p;
    childs[p - 1].push_back(i);
  }
  vector<pair<int, int>> fruits(nbSommet, pair(-1, -1));
  for (int i = 0; i < nbFruits; ++i) {
    int v, d, w;
    cin >> v >> d >> w;
    --v;
    fruits[v] = pair(d - 1, w);
  }

  vector<map<int, int>> changements(nbSommet);

  for (int u = nbSommet - 1; u >= 0; --u) {
    for (int v : childs[u]) {
      if (changements[v].size() > changements[u].size())
        changements[u].swap(changements[v]);
      for (auto [x, delta] : changements[v])
        changements[u][x] += delta;
      changements[v].clear();
    }
    if (fruits[u].first == -1)
      continue;
    auto [d, w] = fruits[u];
    int curDel = 0;
    int lstDel = -1;
    while (true) {
      auto it = changements[u].upper_bound(d);
      if (it == changements[u].end())
        break;
      curDel += it->second;
      if (curDel <= w) {
        changements[u].erase(it);
      } else {
        changements[u][it->first] = curDel - w;
        break;
      }
    }
    changements[u][d] += w;
  }
  int sol = 0;
  for (auto [x, delta] : changements[0])
    sol += delta;
  cout << sol << endl;
}

Compilation message

magictree.cpp: In function 'int main()':
magictree.cpp:64:9: warning: unused variable 'lstDel' [-Wunused-variable]
   64 |     int lstDel = -1;
      |         ^~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 13772 KB Output is correct
2 Correct 34 ms 14252 KB Output is correct
3 Correct 119 ms 18396 KB Output is correct
4 Correct 65 ms 17436 KB Output is correct
5 Correct 97 ms 18184 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 56 ms 13872 KB Output is correct
5 Correct 61 ms 17824 KB Output is correct
6 Correct 60 ms 14128 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 13388 KB Output is correct
2 Correct 50 ms 12880 KB Output is correct
3 Correct 47 ms 11852 KB Output is correct
4 Correct 36 ms 15312 KB Output is correct
5 Correct 38 ms 11980 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 63 ms 14136 KB Output is correct
11 Correct 72 ms 13908 KB Output is correct
12 Correct 42 ms 11852 KB Output is correct
13 Correct 34 ms 15304 KB Output is correct
14 Correct 35 ms 11984 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2516 KB Output is correct
2 Correct 26 ms 11472 KB Output is correct
3 Correct 25 ms 11384 KB Output is correct
4 Correct 27 ms 11312 KB Output is correct
5 Correct 11 ms 10064 KB Output is correct
6 Correct 24 ms 11272 KB Output is correct
7 Correct 26 ms 12044 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 56 ms 13872 KB Output is correct
14 Correct 61 ms 17824 KB Output is correct
15 Correct 60 ms 14128 KB Output is correct
16 Correct 63 ms 14136 KB Output is correct
17 Correct 72 ms 13908 KB Output is correct
18 Correct 42 ms 11852 KB Output is correct
19 Correct 34 ms 15304 KB Output is correct
20 Correct 35 ms 11984 KB Output is correct
21 Correct 14 ms 3480 KB Output is correct
22 Correct 57 ms 14032 KB Output is correct
23 Correct 70 ms 14460 KB Output is correct
24 Correct 110 ms 16576 KB Output is correct
25 Correct 69 ms 16696 KB Output is correct
26 Correct 79 ms 16376 KB Output is correct
27 Correct 73 ms 14720 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 54 ms 13772 KB Output is correct
11 Correct 34 ms 14252 KB Output is correct
12 Correct 119 ms 18396 KB Output is correct
13 Correct 65 ms 17436 KB Output is correct
14 Correct 97 ms 18184 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 56 ms 13872 KB Output is correct
19 Correct 61 ms 17824 KB Output is correct
20 Correct 60 ms 14128 KB Output is correct
21 Correct 56 ms 13388 KB Output is correct
22 Correct 50 ms 12880 KB Output is correct
23 Correct 47 ms 11852 KB Output is correct
24 Correct 36 ms 15312 KB Output is correct
25 Correct 38 ms 11980 KB Output is correct
26 Correct 63 ms 14136 KB Output is correct
27 Correct 72 ms 13908 KB Output is correct
28 Correct 42 ms 11852 KB Output is correct
29 Correct 34 ms 15304 KB Output is correct
30 Correct 35 ms 11984 KB Output is correct
31 Correct 5 ms 2516 KB Output is correct
32 Correct 26 ms 11472 KB Output is correct
33 Correct 25 ms 11384 KB Output is correct
34 Correct 27 ms 11312 KB Output is correct
35 Correct 11 ms 10064 KB Output is correct
36 Correct 24 ms 11272 KB Output is correct
37 Correct 26 ms 12044 KB Output is correct
38 Correct 14 ms 3480 KB Output is correct
39 Correct 57 ms 14032 KB Output is correct
40 Correct 70 ms 14460 KB Output is correct
41 Correct 110 ms 16576 KB Output is correct
42 Correct 69 ms 16696 KB Output is correct
43 Correct 79 ms 16376 KB Output is correct
44 Correct 73 ms 14720 KB Output is correct
45 Correct 16 ms 3668 KB Output is correct
46 Correct 69 ms 14732 KB Output is correct
47 Correct 69 ms 15180 KB Output is correct
48 Correct 158 ms 17812 KB Output is correct
49 Correct 61 ms 17424 KB Output is correct
50 Correct 97 ms 17320 KB Output is correct
51 Correct 80 ms 15680 KB Output is correct