// el psy congroo
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ins insert
#define pii pair<int,int>
#define pb push_back
#define endl '\n'
#define putr(x) cout<<x<<endl;return;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7, sze = 2e5 +23, inf = LLONG_MAX, LG = 20;
vector<int> graph[sze];
int val[sze];
int k;
int dp[sze][501];
int mx[sze];
void dfs(int node,int par=-1){
int a= 0;
for(auto v:graph[node]){
if(v!=par){
dfs(v,node);
int b = mx[v];
a=min(a,k);
b=min(b,k);
for(int i = a;i>=0;i--){
if( (!i) || dp[node][i]){
for(int j= 0;j<=b && ( (i+j)<=k);j++){
if(!(j) || dp[v][j]){
dp[node][i+j]=max(dp[node][i+j],dp[node][i] + dp[v][j]);
}
}
}
}
a+=b;
mx[node]=max(mx[node],a);
}
}
dp[node][1]=max(dp[node][1],val[node]);
mx[node]=max(mx[node],(int)1);
}
void fast(){
int n;
cin>>n>>k;
int root =0;
for(int i=1;i<=n;i++){
int p,w;
cin>>p>>w;
root|=(!p) * i;
if(p!=0){
graph[p].pb(i);
graph[i].pb(p);
}
val[i]=w;
}
dfs(root);
cout<<dp[root][k]<<endl;
}
signed main(){
// ios::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
int tt = 1;
// cin>>tt;
while(tt--){
fast();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4944 KB |
Output is correct |
2 |
Correct |
4 ms |
5200 KB |
Output is correct |
3 |
Correct |
5 ms |
5456 KB |
Output is correct |
4 |
Correct |
33 ms |
40308 KB |
Output is correct |
5 |
Correct |
35 ms |
44872 KB |
Output is correct |
6 |
Correct |
35 ms |
44884 KB |
Output is correct |
7 |
Runtime error |
556 ms |
524288 KB |
Execution killed with signal 9 |
8 |
Runtime error |
584 ms |
524288 KB |
Execution killed with signal 9 |
9 |
Runtime error |
618 ms |
524288 KB |
Execution killed with signal 9 |
10 |
Runtime error |
645 ms |
524288 KB |
Execution killed with signal 9 |