제출 #1020146

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020146		bachhoangxuan	Jobs (BOI24_jobs)	C++17	43 / 100	2045 ms	1048576 KiB

Main

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const long long inf=1e18;
const int mod=998244353;
const int maxn=300005;
const int B=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,x[maxn],s;
vector<int> edge[maxn];
vector<pii> val[maxn];

void dfs(int u){
    for(int v:edge[u]){
        dfs(v);
        for(auto a:val[v]) val[u].push_back(a);
    }
    sort(val[u].begin(),val[u].end());

    vector<pii> nw;
    int ss=max(0LL,-x[u]),cc=ss+x[u];
    for(auto a:val[u]){
        if(a.fi<=cc) cc+=a.se;
        else{
            if(cc-ss>0){
                nw.push_back({ss,cc-ss});
                cc=a.fi+a.se;ss=a.fi;
            }
            else ss+=a.fi-cc,cc=a.fi+a.se;
        }
    }
    if(cc-ss>0) nw.push_back({ss,cc-ss});
    val[u]=nw;
}

void solve(){
    cin >> n >> s;
    for(int i=1;i<=n;i++){
        int p;cin >> x[i] >> p;
        edge[p].push_back(i);
    }
    dfs(0);
    int S=s;
    for(int i=0;i<(int)val[0].size();i++) if(val[0][i].fi<=s) s+=val[0][i].se;
    cout << s-S << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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