Starship Troopers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8420 Accepted Submission(s): 2349
Problem Description
You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each room is occupied by some bugs, and their brains hide in some of the rooms. Scientists have just developed a new weapon and want to experiment it on some brains. Your task is to destroy the whole base, and capture as many brains as possible.
To kill all the bugs is always easier than to capture their brains. A map is drawn for you, with all the rooms marked by the amount of bugs inside, and the possibility of containing a brain. The cavern's structure is like a tree in such a way that there is one unique path leading to each room from the entrance. To finish the battle as soon as possible, you do not want to wait for the troopers to clear a room before advancing to the next one, instead you have to leave some troopers at each room passed to fight all the bugs inside. The troopers never re-enter a room where they have visited before.
A starship trooper can fight against 20 bugs. Since you do not have enough troopers, you can only take some of the rooms and let the nerve gas do the rest of the job. At the mean time, you should maximize the possibility of capturing a brain. To simplify the problem, just maximize the sum of all the possibilities of containing brains for the taken rooms. Making such a plan is a difficult job. You need the help of a computer.
To kill all the bugs is always easier than to capture their brains. A map is drawn for you, with all the rooms marked by the amount of bugs inside, and the possibility of containing a brain. The cavern's structure is like a tree in such a way that there is one unique path leading to each room from the entrance. To finish the battle as soon as possible, you do not want to wait for the troopers to clear a room before advancing to the next one, instead you have to leave some troopers at each room passed to fight all the bugs inside. The troopers never re-enter a room where they have visited before.
A starship trooper can fight against 20 bugs. Since you do not have enough troopers, you can only take some of the rooms and let the nerve gas do the rest of the job. At the mean time, you should maximize the possibility of capturing a brain. To simplify the problem, just maximize the sum of all the possibilities of containing brains for the taken rooms. Making such a plan is a difficult job. You need the help of a computer.
Input
The input contains several test cases. The first line of each test case contains two integers N (0 < N <= 100) and M (0 <= M <= 100), which are the number of rooms in the cavern and the number of starship troopers you have, respectively. The following N lines give the description of the rooms. Each line contains two non-negative integers -- the amount of bugs inside and the possibility of containing a brain, respectively. The next N - 1 lines give the description of tunnels. Each tunnel is described by two integers, which are the indices of the two rooms it connects. Rooms are numbered from 1 and room 1 is the entrance to the cavern.
The last test case is followed by two -1's.
The last test case is followed by two -1's.
Output
For each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.
Sample Input
5 10 50 10 40 10 40 20 65 30 70 30 1 2 1 3 2 4 2 5 1 1 20 7 -1 -1
Sample Output
50 7
Author
XU, Chuan
Source
Recommend
JGShining
题意:
每个节点有两个值bug和brain,当清扫该节点的所有bug时就得到brain值,只有当父节点被清空时,才可以清扫它的子节点,而清扫需要一定的人员。给定M个人员,N个结点的树,求最大brain。
思路:
同hdu1561。只是有些小细节要注意。
1.入口不一定是根节点。
2.即使该洞bug数为0,要获得该洞brain值,也需要至少一人经过该洞穴(可以不停留)。
2.即使该洞bug数为0,要获得该洞brain值,也需要至少一人经过该洞穴(可以不停留)。
dp[i][j]=max(dp[i][j],dp[i][k]+dp[son][j-k]).dp[i][j]表示i结点派j个警察所能获得的最大价值。
son为i结点的儿子结点。
详细见代码:
#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
const int maxn=150;
struct node
{
int v;
node *next;
} edge[maxn<<1],*head[maxn];
int n,m,cnt,dp[maxn][maxn];
int val[maxn],bug[maxn];
void adde(int u,int v)
{
edge[cnt].v=v;
edge[cnt].next=head[u];
head[u]=&edge[cnt++];
}
void dfs(int u,int fa)
{
int i,j,to,lim=(bug[u]+19)/20;
node *p;
for(i=lim;i<=m;i++)//大于lim的都可以获得该节点价值
dp[u][i]=val[u];
for(p=head[u];p!=NULL;p=p->next)
{
to=p->v;
if(to==fa)
continue;
dfs(to,u);
for(i=m;i>=lim;i--)
for(j=1;i-j>=lim;j++)
dp[u][i]=max(dp[u][i],dp[u][i-j]+dp[to][j]);
}
}
int main()
{
int i,a,b;
while(scanf("%d%d",&n,&m))
{
if(n==-1&&m==-1)
break;
cnt=0;
memset(head,0,sizeof head);
memset(dp,0,sizeof dp);
for(i=1;i<=n;i++)
scanf("%d%d",&bug[i],&val[i]);
for(i=1;i<n;i++)
{
scanf("%d%d",&a,&b);
adde(a,b);
adde(b,a);//注意边无向
}
if(m==0)//注意!!
{
printf("0\n");
continue;
}
dfs(1,1);
printf("%d\n",dp[1][m]);
}
return 0;
}
/*
5 0
0 1
0 1
0 5
0 1
0 2
1 2
1 3
2 4
2 5
*/