제출 #973751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973751		phoenix	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	79 / 100	338 ms	109412 KiB

worst_reporter2

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 200200;

int n;

int p[N];
int h[N];
int c[N];

map<int, ll> mp[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) 
        cin >> p[i] >> h[i] >> c[i];
    
    for (int i = 1; i <= n; i++) 
        mp[i][0] = 0;
     
    auto join = [&](int u, int v) {
        if ((int)mp[u].size() < (int)mp[v].size()) swap(mp[u], mp[v]);
        for (auto c : mp[v]) 
            mp[u][c.first] += c.second; 
    };

    for (int v = n; v >= 1; v--) {
        int s = c[v];
        auto it = mp[v].upper_bound(h[v]);
        while (it != mp[v].begin()) {
            it--;
            if (s >= it->second) {
                s -= it->second;
                mp[v].erase(it);
            } else {
                mp[v][it->first] = it->second - s;
                s = 0;
                break;
            }
            it = mp[v].upper_bound(h[v]);
        }
        mp[v][0] += c[v] - s;
        mp[v][h[v] + 1] += c[v]; 
        // cerr << "vertex " << v << ": ";
        // cerr << '{';
        // for (auto c : mp[v]) {
        //     cout << '(' << c.first << ' ' << c.second << ") ";
        // }
        // cout << "}\n";
        
        if (v != 1) join(p[v], v);
    }

    cout << mp[1][0];
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 65 / 65
• Subtask 3: 0 / 21