This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 300010;
vector <int> g[N];
vector <int> raizes;
int val[N];
int dp[N];
int dfs(int v, int p){
int con = 0;
for(auto x : g[v]){
if(x == p) continue;
dfs(x, v);
con++;
}
if(con == 0)
return dp[v] = max(0LL, val[v]);
int vl = val[v];
for(auto x : g[v]){
if(x == p) continue;
vl += dp[x];
}
dp[v] = max(vl, 0LL);
return dp[v];
}
int32_t main(){
int n, c;
cin >> n >> c;
if(c >= 1e18){
for(int i = 1;i <= n;i++){
int p;
cin >> val[i] >> p;
if(p == 0) raizes.push_back(i);
else g[p].push_back(i);
}
int res = 0;
for(auto x : raizes){
res += dfs(x, x);
}
cout << res << '\n';
}
}
# | 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... |