oj.uz

Submission #205961

# Submission time Handle Problem Language Result Execution time Memory
205961 2020-03-01T12:22:33 Z himyu Fireworks (APIO16_fireworks) C++17
55 / 100
 2000 ms 16960 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using i64 = long long;
using d64 = long double;
using pi = pair<int, int>;
using pli = pair<i64, i64>;
using ti = tuple<int, int, int>;
using tli = tuple<i64, i64, i64>;

template <class T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define iterall(cont) cont.begin(), cont.end()
#define prec(n) setprecision(n) << fixed

vector<pli> adj[300001];
const i64 inf = numeric_limits<i64>::max() / 3;

inline i64 ab(i64 x) { return x > 0 ? x : -x; }

class slope {
   public:
    priority_queue<i64> bp;
    i64 sac, fz;

    slope() {
        sac = 0;
        fz = 0;
    }

    void push(i64 x) {
        fz += x;

        if (bp.empty()) {
            bp.push(x);
            bp.push(x);
            ++sac;
            return;
        }

        while (bp.size() > sac + 1) bp.pop();
        auto m1 = bp.top();
        bp.pop();
        auto m2 = bp.top();
        bp.pop();

        bp.push(m1 + x);
        bp.push(m2 + x);
    }
};

void mer(slope* s1, slope* s2) {
    s1->fz += s2->fz;
    s1->sac += s2->sac;
    while (!s2->bp.empty()) s1->bp.push(s2->bp.top()), s2->bp.pop();
    delete s2;
}

slope* solve(int h, int p = -1) {
    slope* ret = new slope();
    for (auto [t, wf] : adj[h]) {
        if (t == p) continue;
        auto chslp = solve(t, h);
        chslp->push(wf);
        mer(ret, chslp);
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int N, M;
    cin >> N >> M;

    for (int i = 2; i <= N + M; i++) {
        i64 j, w;
        cin >> j >> w;

        adj[i].emplace_back(j, w);
        adj[j].emplace_back(i, w);
    }

    auto res = *solve(1);
    vector<i64> bp;
    while (!res.bp.empty()) bp.emplace_back(res.bp.top()), res.bp.pop();
    reverse(iterall(bp));

    for (int i = 0; i < res.sac; i++) res.fz -= bp[i];
    cout << res.fz << endl;

    return 0;
}

Compilation message

fireworks.cpp: In member function 'void slope::push(i64)':
fireworks.cpp:47:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (bp.size() > sac + 1) bp.pop();
                ~~~~~~~~~~^~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7420 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 10 ms 7416 KB Output is correct
6 Correct 10 ms 7416 KB Output is correct
7 Correct 9 ms 7416 KB Output is correct
8 Correct 9 ms 7416 KB Output is correct
9 Correct 9 ms 7416 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct
11 Correct 9 ms 7416 KB Output is correct
12 Correct 10 ms 7416 KB Output is correct
13 Correct 9 ms 7416 KB Output is correct
14 Correct 9 ms 7416 KB Output is correct
15 Correct 10 ms 7416 KB Output is correct
16 Correct 9 ms 7416 KB Output is correct
17 Correct 10 ms 7416 KB Output is correct
18 Correct 9 ms 7416 KB Output is correct
19 Correct 9 ms 7416 KB Output is correct
20 Correct 10 ms 7416 KB Output is correct
21 Correct 11 ms 7416 KB Output is correct
22 Correct 9 ms 7416 KB Output is correct
23 Correct 9 ms 7416 KB Output is correct
24 Correct 9 ms 7416 KB Output is correct
25 Correct 9 ms 7420 KB Output is correct
26 Correct 10 ms 7416 KB Output is correct
27 Correct 9 ms 7416 KB Output is correct
28 Correct 9 ms 7420 KB Output is correct
29 Correct 9 ms 7416 KB Output is correct
30 Correct 9 ms 7416 KB Output is correct
31 Correct 12 ms 7416 KB Output is correct
32 Correct 12 ms 7544 KB Output is correct
33 Correct 14 ms 7672 KB Output is correct
34 Correct 15 ms 7544 KB Output is correct
35 Correct 21 ms 7672 KB Output is correct
36 Correct 18 ms 7672 KB Output is correct
37 Correct 18 ms 7672 KB Output is correct
38 Correct 28 ms 7672 KB Output is correct
39 Correct 22 ms 7672 KB Output is correct
40 Correct 12 ms 8440 KB Output is correct
41 Correct 12 ms 8440 KB Output is correct
42 Correct 12 ms 7672 KB Output is correct
43 Correct 212 ms 8056 KB Output is correct
44 Correct 174 ms 8184 KB Output is correct
45 Correct 163 ms 7928 KB Output is correct
46 Correct 13 ms 7800 KB Output is correct
47 Correct 13 ms 7928 KB Output is correct
48 Correct 13 ms 7800 KB Output is correct
49 Correct 13 ms 7804 KB Output is correct
50 Correct 13 ms 7800 KB Output is correct
51 Correct 12 ms 7800 KB Output is correct
52 Correct 17 ms 7800 KB Output is correct
53 Correct 14 ms 7800 KB Output is correct
54 Correct 13 ms 7928 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7420 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 10 ms 7416 KB Output is correct
6 Correct 10 ms 7416 KB Output is correct
7 Correct 9 ms 7416 KB Output is correct
8 Correct 9 ms 7416 KB Output is correct
9 Correct 9 ms 7416 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct
11 Correct 9 ms 7416 KB Output is correct
12 Correct 10 ms 7416 KB Output is correct
13 Correct 9 ms 7416 KB Output is correct
14 Correct 9 ms 7416 KB Output is correct
15 Correct 10 ms 7416 KB Output is correct
16 Correct 9 ms 7416 KB Output is correct
17 Correct 10 ms 7416 KB Output is correct
18 Correct 9 ms 7416 KB Output is correct
19 Correct 9 ms 7416 KB Output is correct
20 Correct 10 ms 7416 KB Output is correct
21 Correct 11 ms 7416 KB Output is correct
22 Correct 9 ms 7416 KB Output is correct
23 Correct 9 ms 7416 KB Output is correct
24 Correct 9 ms 7416 KB Output is correct
25 Correct 9 ms 7420 KB Output is correct
26 Correct 10 ms 7416 KB Output is correct
27 Correct 9 ms 7416 KB Output is correct
28 Correct 9 ms 7420 KB Output is correct
29 Correct 9 ms 7416 KB Output is correct
30 Correct 9 ms 7416 KB Output is correct
31 Correct 12 ms 7416 KB Output is correct
32 Correct 12 ms 7544 KB Output is correct
33 Correct 14 ms 7672 KB Output is correct
34 Correct 15 ms 7544 KB Output is correct
35 Correct 21 ms 7672 KB Output is correct
36 Correct 18 ms 7672 KB Output is correct
37 Correct 18 ms 7672 KB Output is correct
38 Correct 28 ms 7672 KB Output is correct
39 Correct 22 ms 7672 KB Output is correct
40 Correct 12 ms 8440 KB Output is correct
41 Correct 12 ms 8440 KB Output is correct
42 Correct 12 ms 7672 KB Output is correct
43 Correct 212 ms 8056 KB Output is correct
44 Correct 174 ms 8184 KB Output is correct
45 Correct 163 ms 7928 KB Output is correct
46 Correct 13 ms 7800 KB Output is correct
47 Correct 13 ms 7928 KB Output is correct
48 Correct 13 ms 7800 KB Output is correct
49 Correct 13 ms 7804 KB Output is correct
50 Correct 13 ms 7800 KB Output is correct
51 Correct 12 ms 7800 KB Output is correct
52 Correct 17 ms 7800 KB Output is correct
53 Correct 14 ms 7800 KB Output is correct
54 Correct 13 ms 7928 KB Output is correct
55 Correct 58 ms 8312 KB Output is correct
56 Correct 453 ms 10852 KB Output is correct
57 Correct 947 ms 12792 KB Output is correct
58 Correct 1099 ms 14840 KB Output is correct
59 Execution timed out 2088 ms 16960 KB Time limit exceeded
60 Halted 0 ms 0 KB -