제출 #696845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696845		Ooops_sorry	Fireworks (APIO16_fireworks)	C++14	26 / 100	20 ms	21512 KiB

fireworks

#include<bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define pb push_back
#define ld long double
#define ll long long

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 3e5 + 10;
vector<int> g[N];
multiset<int> st[N];
ll k[N], b[N];
int c[N];

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i < n + m; i++) {
        int p;
        cin >> p >> c[i];
        p--;
        g[p].pb(i);
    }
    for (int i = n; i < n + m; i++) {
        k[i] = 1;
        b[i] = -c[i];
        st[i].insert(c[i]);
        st[i].insert(c[i]);
    }
    for (int i = n - 1; i >= 0; i--) {
        for (auto to : g[i]) {
            k[i] += k[to];
            b[i] += b[to];
            if (st[to].size() > st[i].size()) {
                swap(st[i], st[to]);
            }
            for (auto x : st[to]) {
                st[i].insert(x);
            }
        }
        while (k[i] > 1) {
            k[i]--;
            b[i] += *st[i].rbegin();
            st[i].erase(st[i].find(*st[i].rbegin()));
        }
        if (c[i] > 0) {
            int slope1 = *st[i].rbegin();
            st[i].erase(st[i].find(slope1));
            int slope0 = *st[i].rbegin();
            st[i].erase(st[i].find(slope0));
            st[i].insert(slope0 + c[i]);
            st[i].insert(slope1 + c[i]);
            b[i] -= c[i];
        }
    }
    while (k[0] > 0) {
        k[0]--;
        b[0] += *st[0].rbegin();
        st[0].erase(st[0].find(*st[0].rbegin()));
    }
    cout << b[0] << endl;
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 19 / 19
• Subtask 3: 0 / 29
• Subtask 4: 0 / 45