제출 #1276809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276809		HiepVu217	Jobs (BOI24_jobs)	C++20	100 / 100	185 ms	68156 KiB

Main

//Proud of You//
#include <bits/stdc++.h>
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
const int N = 3e5 + 17;
int n, a[N];
long long s, ans;
vector <int> adj[N];
struct block
{
    long long req, sum;
    bool operator < (const block &o) const
    {
        if (req == o.req)
        {
            return sum > o.sum;
        }
        return req > o.req;
    }
};
priority_queue <block> pq[N];
inline void combine (int u, block x)
{
    while (!pq[u].empty())
    {
        block y = pq[u].top();
        if (x.sum < 0)
        {
            x = {max (x.req, y.req - x.sum), x.sum + y.sum};
            pq[u].pop();
            continue;
        }
        if (x.req >= y.req)
        {
            x = {x.req, x.sum + y.sum};
            pq[u].pop();
            continue;
        }
        break;
    }
    if (x.sum >= 0)
    {
        pq[u].push(x);
    }
}
inline void dfs (int u)
{
    for (int v: adj[u])
    {
        dfs(v);
        if (pq[v].size() > pq[u].size())
        {
            swap (pq[u], pq[v]);
        }
        while (!pq[v].empty())
        {
            pq[u].push (pq[v].top());
            pq[v].pop();
        }
    }
    combine (u, {max (0, -a[u]), a[u]});
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> s;
    for (int i = 1, j; i <= n; ++i)
    {
        cin >> a[i] >> j;
        adj[j].push_back(i);
    }
    dfs(0);
    while (!pq[0].empty())
    {
        auto [req, sum] = pq[0].top();
        pq[0].pop();
        if (s + ans >= req)
        {
            ans += sum;
        }
    }
    cout << ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 29 / 29
• Subtask 5: 31 / 31