제출 #1264759

#제출 시각아이디문제언어결과실행 시간메모리
1264759Nika533Jobs (BOI24_jobs)C++20
0 / 100
9 ms9940 KiB
#include <bits/stdc++.h> #define pb push_back using namespace std; const int N=3e5+5; int n,s,dp[N],p[N],arr[N]; vector<int> g[N]; void dfs(int x) { dp[x]=arr[x]; for (auto y:g[x]) { dfs(y); if (dp[y]>0) dp[x]+=dp[y]; } } int main() { cin>>n>>s; for (int i=1; i<=n; i++) { cin>>arr[i]>>p[i]; g[p[i]].pb(i); } dfs(0); cout<<s+dp[0]<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...