제출 #1110825

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1110825		cpptowin	Jobs (BOI24_jobs)	C++17	100 / 100	279 ms	116132 KiB

Main

#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
    x += k;
    x %= mod;
    if(x < 0) x += mod;
}
void del(int &x, int k)
{
    x -= k;
    x %= mod;
    if(x < 0) x += mod;
}
vi ke[maxn];
int a[maxn];
priority_queue<pii> q[maxn];
int n;
void dfs(int u)
{
    for(int v : ke[u])
    {
        dfs(v);
        if(ss(q[v]) > ss(q[u])) swap(q[u],q[v]);
        while(ss(q[v]))
        {
            q[u].push(q[v].top());
            q[v].pop();
        }
    }
    if(a[u] >= 0) q[u].push({0,a[u]});
    else
    {
        pii now = {a[u],a[u]};
        while(ss(q[u]) and now.se < 0)
        {
            auto [minn,val] = q[u].top();
            q[u].pop();
            now.fi = min(now.fi,now.se + minn);
            now.se += val;
        }
        if(now.se >= 0)
        {
            while(ss(q[u]) and q[u].top().fi >= now.fi)
            {
                now.se += q[u].top().se;
                q[u].pop();
            }
            q[u].push(now);
        }
    }
}
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> a[0];
    fo(i,1,n)
    {
        int v;
        cin >> a[i] >> v;
        ke[v].pb(i);
    }
    dfs(0);
    int ans = 0;
    while(ss(q[0]) and ans + q[0].top().fi >= 0)
    {
        ans += q[0].top().se;
        q[0].pop();
    }
    cout << ans - a[0];
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp:96:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   96 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:101:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:102:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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