# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1264760 | Nika533 | Jobs (BOI24_jobs) | C++20 | 160 ms | 22472 KiB |
#include <bits/stdc++.h>
#define int long long
#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];
}
}
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;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |