Submission #1051333

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051333		nisanduu	Jobs (BOI24_jobs)	C++14	11 / 100	262 ms	48976 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dfs(ll node,vector<vector<ll>>&adj,ll money,ll p,map<ll,ll> &cost){
    ll cr = money;
    cr += cost[node];
    for(auto el:adj[node]){
        if(el!=p){
            cr = max(cr,dfs(el,adj,cr,node,cost));
        }
    }
    return cr;
}

void solve(){
    ll n,s;
    cin>>n>>s;
    vector<vector<ll>> adj(n+10);
    map<ll,ll> cost;
    vector<ll> edges(n+10);
    queue<ll> q;
    for(ll i=0;i<n;i++){
        ll x,p;
        cin>>x>>p;
        cost[i] = x;
        if(p==0){
            q.push(i);
        }else{
            edges[i]++;
            adj[p-1].push_back(i);
        }
    }
    ll ans = 0;
    while(!q.empty()){
        ll node = q.front();
        //cout<<node<<endl;
        q.pop();
        ll y = dfs(node,adj,0,-1,cost);
        ans += max(0LL,y);
    }
    cout<<ans<<endl;
}
int main()
{
    
    solve();

    return 0;
}

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