HDU P1011(TreeDP)
来源:互联网 发布:耳根算是网络写手吗? 编辑:程序博客网 时间:2024/06/10 08:56
Starship Troopers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5385 Accepted Submission(s): 1429
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.
这题太恶心了,题意各种混乱。
#include<stdio.h>#include<string.h>#include<vector>#define maxn 110#define Clear(a,b) memset(a,b,sizeof(a))using namespace std;int emy[maxn],bug[maxn],dp[maxn][maxn],pos[maxn];vector <int> links[maxn];int s;int Max(int a,int b){ if (a > b) return a; return b;}void dfs(int k,int fa){ int m = links[k].size(),son,i,j,c; for(i = bug[k];i <= s;i++) dp[k][i] = pos[k]; if (k != 1 && m <= 1) {/* printf("%d:",k); for(i = 1;i <= s;i++) printf(" %d",dp[k][i]); printf("\n");*/ //for(i = bug[k];i <= s;i++) dp[k][i] = pos[k]; return ; } for(i = 0;i < m;i++) { son = links[k][i]; if (son == fa) continue; dfs(son,k); } for(i = 0;i < m;i++) { son = links[k][i]; if (son == fa) continue; for(c = s;c >= bug[k];c--) for(j = 1;j <= c;j++) if (c - j >= bug[k]) dp[k][c] = Max(dp[k][c],dp[k][c-j] + dp[son][j]); } //for(i = 0;i < bug[k];i++) dp[k][i] = 0; //for(i = s;i >= bug[k];i--) dp[k][i] = dp[k][i-bug[k]] + pos[k];/* printf("%d:",k); for(i = 1;i <= s;i++) printf(" %d",dp[k][i]); printf("\n");*/ return ;}int work(){ int n,i,a,b; Clear(bug,0); Clear(pos,0); Clear(dp,0); Clear(emy,0); scanf("%d%d",&n,&s); if (n == -1) return 0; for(i = 1;i <= n;i++) links[i].clear(); for(i = 1;i <= n;i++) scanf("%d%d",&bug[i],&pos[i]); for(i = 1;i <= n;i++) bug[i] = (bug[i] / 20) + (bug[i] % 20 != 0);/* for(i = 1;i <= n;i++) printf("%d ",bug[i]); printf("\n");*/ for(i = 1;i < n;i++) { scanf("%d%d",&a,&b); links[a].push_back(b); links[b].push_back(a); } for(i = 1;i <= n;i++) if (i != 1 && links[i].size() == 1 && bug[i] == 0) bug[i] = 1; dfs(1,0); if (s == 0) {printf("0\n");return 1;} printf("%d\n",dp[1][s]); return 1;}int main(){ while(work()); return 0;}
- HDU P1011(TreeDP)
- HDU P1520(TreeDP)
- HDU P2196(TreeDP)
- HDU-4354-treeDP
- HDU-4008-treeDP
- hdu 1561 treedp
- p1011
- HDU-4044-treeDP+分组背包
- HDU 1561 The more, The Better (treeDP 背包) #by Plato
- pku2486 treedp
- BZOJ2435【TreeDP】
- TYVJ P1011 传纸条
- (剪枝)stick(P1011)
- Tyvj P1011 传纸条
- TYVJ p1011 传纸条
- vijos-p1011 2008.11.7
- 洛谷 P1011 车站
- P1011传纸条
- From mac to access Winxp by virtualbox
- EJB学习日志
- openstack nova 基础知识——cfg
- 曲率(Curvature)
- 裹在刘翔奥运失利事件上的十六层谜云
- HDU P1011(TreeDP)
- Steve Pavlina的睡眠日志
- Fedora自动登录root用户
- 毕业了,然后呢?!那些繁华如梦的似水流年和魂牵梦绕的若即若离~~~
- 第二十七章 Introduction to Perl Programming(中文版)
- 跟踪上传进度PHP和JavaScript
- Node(25) sharing code between client and server
- 通过配置ant提高EJB开发效率
- 无法执行添加/移除操作,因为代码元素CxxxDlg.cpp是只读的