oj.uz

Submission #201304

# Submission time Handle Problem Language Result Execution time Memory
201304 2020-02-10T07:16:17 Z jun6873 Fireworks (APIO16_fireworks) C++11
7 / 100
 11 ms 7420 KB 
#include <bits/stdc++.h>
using namespace std;

using lint = long long;
using pint = pair<int, int>;
#define x first
#define y second

const int maxn = 300004;

int N, M;
vector<pint> g[maxn];

struct func {
    priority_queue<lint> neg;
    priority_queue<lint, vector<lint>, greater<lint> > pos;
    lint mn = 0;
    void balance() {
        while (neg.top() > pos.top()) {
            lint x = neg.top(), y = pos.top();
            neg.pop(); pos.pop();
            pos.push(x); neg.push(y);
            mn += x - y;
        }
    }
    void add(lint a, lint b, lint c) {
        neg.push(a);
        pos.push(b);
        mn += c;
        balance();
    }
    void process(lint x) {
        lint b = neg.top() + x, c = pos.top() + x;
        while (!pos.empty()) pos.pop();
        neg.pop();
        neg.push(b);
        pos.push(c);
    }
} *b[maxn];

void dfs(int x) {
    func *f = new func();
    for (pint i : g[x]) if (!g[i.x].empty()) {
        dfs(i.x);
        b[i.x]->process(i.y);
        if (f->neg.size() < b[i.x]->neg.size()) f = b[i.x];
    }
    b[x] = f;

    for (pint i : g[x]) if (f != b[i.x]) {
        if (!g[i.x].empty()) {
            func *g = b[i.x];
            while (!g->neg.empty()) f->neg.push(g->neg.top()), g->neg.pop();
            while (!g->pos.empty()) f->pos.push(g->pos.top()), g->pos.pop();
            f->mn += g->mn;
        } else f->add(i.y, i.y, 0);
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);

    cin >> N >> M;

    for (int i=2; i<=N+M; i++) {
        int x, y;
        cin >> x >> y;
        g[x].emplace_back(i, y);
    }

    dfs(1);

    cout << b[1]->mn << '\n';
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7416 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 9 ms 7416 KB Output is correct
6 Correct 9 ms 7416 KB Output is correct
7 Correct 10 ms 7420 KB Output is correct
8 Correct 11 ms 7392 KB Output is correct
9 Correct 9 ms 7416 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Incorrect 9 ms 7416 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7416 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 9 ms 7416 KB Output is correct
6 Correct 9 ms 7416 KB Output is correct
7 Correct 10 ms 7420 KB Output is correct
8 Correct 11 ms 7392 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 Incorrect 9 ms 7416 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7416 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 9 ms 7416 KB Output is correct
6 Correct 9 ms 7416 KB Output is correct
7 Correct 10 ms 7420 KB Output is correct
8 Correct 11 ms 7392 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 Incorrect 9 ms 7416 KB Output isn't correct
13 Halted 0 ms 0 KB -