oj.uz

Submission #386039

# Submission time Handle Problem Language Result Execution time Memory
386039 2021-04-05T13:21:44 Z MiricaMatei Fireworks (APIO16_fireworks) C++14
26 / 100
 14 ms 16876 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN =  300005;

vector<int>G[MAXN];
priority_queue<int>pq[MAXN];
long long a[MAXN], b[MAXN];
int c[MAXN];

int main() {

  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 2; i <= n + m; ++i) {
    int p;
    scanf("%d%d", &p, &c[i]);
    G[p].push_back(i);
  }

  for (int i = n + 1; i <= n + m; ++i) {
    pq[i].push(c[i]);
    pq[i].push(c[i]);
    a[i] = 1;
    b[i] = -c[i];
  }

  for (int i = n; i >= 1; --i) {
    for (auto it:G[i]) {
      if (pq[i].size() < pq[it].size())
        swap(pq[i], pq[it]);
      while (!pq[it].empty()) {
        pq[i].push(pq[it].top());
        pq[it].pop();
      }
      a[i] += a[it];
      b[i] += b[it];
    }
    while (a[i] > 1) {
      int x = pq[i].top();
      a[i]--;
      b[i] += x;
      pq[i].pop();
    }

    b[i] -= c[i];
    int x1 = pq[i].top();
    pq[i].pop();
    int x0 = pq[i].top();
    pq[i].pop();
    x1 += c[i];
    x0 += c[i];
    pq[i].push(x0);
    pq[i].push(x1);
  }

  while (a[1] > 0) {
    int x = pq[1].top();
    a[1]--;
    b[1] += x;
    pq[1].pop();
  }

  printf("%lld\n", b[1]);

  return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |   scanf("%d%d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~
fireworks.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |     scanf("%d%d", &p, &c[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16748 KB Output is correct
2 Correct 12 ms 16748 KB Output is correct
3 Correct 14 ms 16748 KB Output is correct
4 Correct 12 ms 16748 KB Output is correct
5 Correct 12 ms 16748 KB Output is correct
6 Correct 12 ms 16748 KB Output is correct
7 Correct 12 ms 16748 KB Output is correct
8 Correct 12 ms 16748 KB Output is correct
9 Correct 12 ms 16748 KB Output is correct
10 Correct 12 ms 16748 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16748 KB Output is correct
2 Correct 11 ms 16748 KB Output is correct
3 Correct 12 ms 16748 KB Output is correct
4 Correct 13 ms 16768 KB Output is correct
5 Correct 12 ms 16748 KB Output is correct
6 Correct 13 ms 16780 KB Output is correct
7 Correct 12 ms 16748 KB Output is correct
8 Correct 12 ms 16748 KB Output is correct
9 Correct 13 ms 16876 KB Output is correct
10 Correct 12 ms 16876 KB Output is correct
11 Correct 12 ms 16748 KB Output is correct
12 Correct 12 ms 16748 KB Output is correct
13 Correct 12 ms 16748 KB Output is correct
14 Correct 12 ms 16748 KB Output is correct
15 Correct 14 ms 16748 KB Output is correct
16 Correct 12 ms 16748 KB Output is correct
17 Correct 13 ms 16748 KB Output is correct
18 Correct 12 ms 16748 KB Output is correct
19 Correct 12 ms 16748 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16748 KB Output is correct
2 Correct 12 ms 16748 KB Output is correct
3 Correct 14 ms 16748 KB Output is correct
4 Correct 12 ms 16748 KB Output is correct
5 Correct 12 ms 16748 KB Output is correct
6 Correct 12 ms 16748 KB Output is correct
7 Correct 12 ms 16748 KB Output is correct
8 Correct 12 ms 16748 KB Output is correct
9 Correct 12 ms 16748 KB Output is correct
10 Correct 12 ms 16748 KB Output is correct
11 Correct 11 ms 16748 KB Output is correct
12 Correct 11 ms 16748 KB Output is correct
13 Correct 12 ms 16748 KB Output is correct
14 Correct 13 ms 16768 KB Output is correct
15 Correct 12 ms 16748 KB Output is correct
16 Correct 13 ms 16780 KB Output is correct
17 Correct 12 ms 16748 KB Output is correct
18 Correct 12 ms 16748 KB Output is correct
19 Correct 13 ms 16876 KB Output is correct
20 Correct 12 ms 16876 KB Output is correct
21 Correct 12 ms 16748 KB Output is correct
22 Correct 12 ms 16748 KB Output is correct
23 Correct 12 ms 16748 KB Output is correct
24 Correct 12 ms 16748 KB Output is correct
25 Correct 14 ms 16748 KB Output is correct
26 Correct 12 ms 16748 KB Output is correct
27 Correct 13 ms 16748 KB Output is correct
28 Correct 12 ms 16748 KB Output is correct
29 Correct 12 ms 16748 KB Output is correct
30 Incorrect 12 ms 16748 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16748 KB Output is correct
2 Correct 12 ms 16748 KB Output is correct
3 Correct 14 ms 16748 KB Output is correct
4 Correct 12 ms 16748 KB Output is correct
5 Correct 12 ms 16748 KB Output is correct
6 Correct 12 ms 16748 KB Output is correct
7 Correct 12 ms 16748 KB Output is correct
8 Correct 12 ms 16748 KB Output is correct
9 Correct 12 ms 16748 KB Output is correct
10 Correct 12 ms 16748 KB Output is correct
11 Correct 11 ms 16748 KB Output is correct
12 Correct 11 ms 16748 KB Output is correct
13 Correct 12 ms 16748 KB Output is correct
14 Correct 13 ms 16768 KB Output is correct
15 Correct 12 ms 16748 KB Output is correct
16 Correct 13 ms 16780 KB Output is correct
17 Correct 12 ms 16748 KB Output is correct
18 Correct 12 ms 16748 KB Output is correct
19 Correct 13 ms 16876 KB Output is correct
20 Correct 12 ms 16876 KB Output is correct
21 Correct 12 ms 16748 KB Output is correct
22 Correct 12 ms 16748 KB Output is correct
23 Correct 12 ms 16748 KB Output is correct
24 Correct 12 ms 16748 KB Output is correct
25 Correct 14 ms 16748 KB Output is correct
26 Correct 12 ms 16748 KB Output is correct
27 Correct 13 ms 16748 KB Output is correct
28 Correct 12 ms 16748 KB Output is correct
29 Correct 12 ms 16748 KB Output is correct
30 Incorrect 12 ms 16748 KB Output isn't correct
31 Halted 0 ms 0 KB -