제출 #1003192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003192		Khanhcsp2	Jobs (BOI24_jobs)	C++14	0 / 100	64 ms	24144 KiB

Main

#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=3e5+11;
int n, s, x[N], p[N], ans;
vector<int> adj[N];
void dfs(int u, int s)
{
    s+=x[u];
    if(s<0) return;
    ans=max(ans, s);
    for(int v:adj[u]) dfs(v, s);
}
void sol()
{
    cin >> n >> s;
    for(int i=1;i<=n;i++)
    {
        cin >> x[i] >> p[i];
        if(p[i]) adj[p[i]].push_back(i);
    }
    for(int i=1;i<=n;i++)
    {
        if(p[i]==0)
        {
            dfs(i, s);
        }
    }
    cout << ans;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

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