제출 #1182165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182165		steveonalex	Jobs (BOI24_jobs)	C++20	0 / 100	2039 ms	814824 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3e5 + 69;
int n; ll s;
vector<int> graph[N];
int p[N];
ll a[N];
vector<pair<ll,ll>> dp[N];

vector<pair<ll, ll>> society(vector<pair<ll, ll>> diff){
    sort(ALL(diff));
    vector<pair<ll, ll>> ans;
    ans.push_back(make_pair(0, 0));
    for(pair<ll, ll> i: diff){
        if (ans.back().first + ans.back().second <= i.first){
            ans.back().second += i.second;
        }
        else{
            ans.push_back(make_pair(i.first, ans.back().second + i.second));
        }
    }
    return ans;
}

void dfs(int u){
    vector<pair<ll, ll>> tot;
    for(int v: graph[u]) {
        dfs(v);
        tot.push_back(dp[v][0]);
        for(int i = 1; i< (int) dp[v].size(); ++i)
            tot.push_back(make_pair(dp[v][i].first, dp[v][i].second - dp[v][i-1].second));
    }
    dp[u] = society(tot);
    if (a[u] >= 0){
        vector<pair<ll, ll>> tmp;
        tmp.push_back(make_pair(0, a[u]));
        for(pair<ll, ll> i: dp[u]){
            if (i.first <= a[u]) {
                tmp.back().second = a[u] + i.second;
            }
            else {
                i.first -= a[u]; i.second += a[u];
                tmp.push_back(i);
            }
        }
        dp[u] = tmp;
    }
    else{
        vector<pair<ll, ll>> tmp;
        tmp.push_back(make_pair(0, 0));
        for(pair<ll, ll> i: dp[u]){
            i.first -= a[u];
            i.second += a[u];
            if (i.second > 0) tmp.push_back(i);
        }
        dp[u] = tmp;
    }

    // cout << "Node: " << u << "\n";
    // for(auto i: dp[u]) cout << "(" << i.first << ", " << i.second << ")\n";
}

void solve(){
    cin >> n >> s;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i] >> p[i];
        graph[p[i]].push_back(i);
    }

    dfs(0);

    ll ans = 0;
    for(auto i: dp[0]) if (s >= i.first) maximize(ans, i.second);

    cout << ans << "\n";
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

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