P2014 [CTSC1997] 选课

                                                                P2014 [CTSC1997] 选课

[CTSC1997] 选课 - 洛谷

 思路：我们定义f[u][j]为以u为根节点，并且选择j个节点能够获得的最大价值，那么会有

f[u][j]=max(f[u][j],f[u][j-k]+f[e[i]][k])，注意枚举时需要设f[u][1]=cost[u]，且再枚举k时从0枚举到j-1因为如果当前子树存在，则当前节点的根节点必须要选择，并且j从m+1枚举到1，因为0号节点必须要选择，至少选择一个点

// Problem: P2014 [CTSC1997] 选课
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P2014
// Memory Limit: 125 MB
// Time Limit: 1000 ms

#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector> 
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}

int T,hackT;
int n,m,k;
int h[N],e[M],ne[M],idx;
int cost[N];
int f[310][310];

void add(int a,int b) {
	e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}

void dfs(int u) {
	f[u][1]=cost[u];
	for(int i=h[u];i!=-1;i=ne[i]) {
		dfs(e[i]);
		
		for(int j=m+1;j>=1;j--) {
			for(int k=0;k<j;k++) {
				f[u][j]=max(f[u][j],f[u][j-k]+f[e[i]][k]);
			}
		}
	}
}

void solve() {
	n=read(),m=read();
	
	memset(h,-1,sizeof h);
	for(int i=1;i<=n;i++) {
		int k=read();
		cost[i]=read(); 
		add(k,i);
	}
	
	dfs(0);
	
	write(f[0][m+1],'\n');
}   

int main() {
    // init();
    // stin();

    // scanf("%d",&T);
    T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}