题目大意:一棵树,每个点是一个物品,有个数,价格,收益,要求买的物品集合必须是一个连通块,求最大收益
题解:枚举一个点作为根必选,然后变成了树形依赖多重背包
对于树形依赖01背包,可以在dfs序上dp
f[i][j]=max(f[i+1][j−v[i]]+w[i],f[i+sz[i]][j])
f[i][j]表示i以及以后dfs序的点占用j的空间的最大价值。
多重背包随便单调队列一下
然后用点分治代替枚举……
我的收获:点分枚举根……树形依赖背包
#include<cstdio>
#include<cstring>
#define N 5002
#define M 4001
#define E 1005
#define For(a, b, c) for(int a = b; a <= c; ++a)
#define Forr(a, b, c) for(int a = b; a >= c; --a)
using namespace std;
const int inf = 1e9;
int n,m,wei[N],cost[N],cnt[N];
inline int max(int a,int b){return a>b?a:b;}
int e,be[N],to[E],ne[E];
inline void Add(int u, int v){
to[++e]=v,ne[e]=be[u],be[u]=e;
}
int sz[N], f[N], rt, tot;
bool del[N];
inline void dfs1(int x, int fa){ //找重心
sz[x] = 1, f[x] = 0;
for(int i = be[x]; i; i = ne[i]){
int v = to[i];
if(v == fa || del[v]) continue;
dfs1(v, x);
sz[x] += sz[v];
f[x] = max(f[x], sz[v]);
}
f[x] = max(f[x], tot - sz[x]);
if(f[x] < f[rt]) rt = x;
}
int cod, base[N];
inline void dfs3(int x, int fa){ //处理sz[],base[]
base[++cod] = x, sz[x] = 1;
for(int i = be[x]; i; i = ne[i])
if(to[i] != fa && !del[to[i]]) dfs3(to[i], x), sz[x] += sz[to[i]];
}
int dp[N][M], ans;
inline void Pack(int now, int v, int w, int lim){
int va[M], vb[M];
For(j,0,v - 1){
int *pb = va, *pe = va - 1;
int *qb = vb, *qe = vb - 1;
for(int k = j, i = 0; k <= m; k += v, ++i){
if(pe == pb + lim){
if(*qb == *pb) ++qb;
++pb;
}
int tt = dp[now + 1][k] - i * w;
if(i) dp[now][k] = *qb + i * w;
while(qe >= qb && *qe <= tt) --qe;
*++qe = tt; *++pe = tt;
}
}
}
inline void Dp(){
Forr(i, cod, 1){
int k = base[i];
Pack(i, cost[k], wei[k], cnt[k]);
For(j, 0, m) dp[i][j] = max(dp[i][j], dp[i + sz[k]][j]);
}
For(i, 0, m) ans = max(ans, dp[1][i]); //只在1取答案
For(i, 1, cod) For(j, 0, m) dp[i][j] = 0; //清空
}
inline void Solve(int now){
cod=0,dfs3(now,0);
Dp();
del[now]=1;
for(int i=be[rt];i;i=ne[i]){
int v=to[i];
if(del[v]) continue;
tot=sz[v],rt=0,dfs1(v,now);
Solve(rt);
}
}
void clear()
{
e=0,ans=0;
memset(be,0,sizeof(be));
memset(del,0,sizeof(del));
}
void work()
{
rt=0,f[0]=inf,tot=n;
dfs1(1,0);
Solve(rt);
printf("%d\n",ans);
}
void init()
{
clear();
scanf("%d%d",&n,&m);
For(i,1,n) scanf("%d",&wei[i]);
For(i,1,n) scanf("%d",&cost[i]);
For(i,1,n) scanf("%d",&cnt[i]);
For(i,1,n-1){
int u,v;
scanf("%d%d",&u,&v);
Add(u,v),Add(v,u);
}
}
int main()
{
int T;
scanf("%d", &T);
while(T--) init(),work();
return 0;
}