Starship Troopers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15457 Accepted Submission(s): 4152
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
题意：n个房间m个士兵，接下来n行表示每个房间bug和收益，其中一个士兵能干掉20个bug,然后n-1行是房间之间连通情况，问m个人最大的收益
dp[i][j]表示根节点为i，j个士兵的收益，则dp[i][j] = max{dp[ i ][ j ], dp[ i ][j - k] + dp[ son[i] ][k] }
当一个房间的bug为0是也需要一个士兵，所以当m = 0时直接输出0
节点减一
1 #include <iostream> 2 #include <cstring> 3 #include <algorithm> 4 #include <cstdio> 5 #include <vector> 6 using namespace std; 7 const int MAX = 110; 8 int dp[MAX][MAX],vis[MAX],bug[MAX],p[MAX]; 9 vector<int> son[MAX]; 10 int n,m; 11 void dfs(int u) 12 { 13 vis[u] = true; 14 for(int i = bug[u]; i <= m; i++) 15 dp[u][i] = p[u]; 16 int tot = (int) son[u].size(); 17 for(int i = 0; i < tot; i++) 18 { 19 int v = son[u][i]; 20 if(vis[v]) 21 continue; 22 dfs(v); 23 for(int j = m; j >= bug[u]; j--) 24 { 25 for(int k = 1; k <= j - bug[u]; k++) 26 { 27 if(dp[u][j] < dp[u][j - k] + dp[v][k]) 28 dp[u][j] = dp[u][j - k] + dp[v][k]; 29 } 30 } 31 } 32 } 33 int main() 34 { 35 while(scanf("%d%d", &n, &m) != EOF) 36 { 37 if(n == -1 && m == -1) 38 break; 39 for(int i = 0; i < n; i++) 40 { 41 scanf("%d%d", &bug[i], &p[i]); 42 bug[i] = (bug[i] + 19) / 20; 43 } 44 for(int i = 0; i <= n; i++) 45 son[i].clear(); 46 for(int i = 0; i < n - 1; i++) 47 { 48 int a,b; 49 scanf("%d%d", &a, &b); 50 son[a - 1].push_back(b - 1); 51 son[b - 1].push_back(a - 1); 52 } 53 if(m == 0) 54 printf("0 "); 55 else 56 { 57 memset(vis, false, sizeof(vis)); 58 memset(dp, 0, sizeof(dp)); 59 dfs(0); 60 printf("%d ", dp[0][m]); 61 } 62 63 } 64 65 return 0; 66 }