제출 #682447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
682447		stevancv	Fireworks (APIO16_fireworks)	C++14	7 / 100	7 ms	9744 KiB

fireworks

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 3e5 + 2;
const ll linf = 9e18;
priority_queue<ll> pq[N];
int deg[N], par[N];
ll len[N], dp[N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 2; i <= n + m; i++) {
        cin >> par[i] >> len[i];
        deg[par[i]]++;
        dp[par[i]] -= len[i];
        if (i > n) {
            pq[par[i]].push(len[i]);
            pq[par[i]].push(len[i]);
        }
    }
    for (int i = n; i > 1; i--) {
        for (int j = 0; j < deg[i] - 1; j++) {
            dp[i] += pq[i].top();
            pq[i].pop();
        }
        pq[par[i]].push(pq[i].top() + len[i]);
        pq[i].pop();
        pq[par[i]].push(pq[i].top() + len[i]);
        pq[i].pop();
        dp[par[i]] += dp[i];
    }
    ll ans = 0;
    for (int j = 0; j < deg[1]; j++) {
        ans += pq[1].top();
        pq[1].pop();
    }
    cout << dp[1] + ans << en;
    return 0;
}

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