hdu 1011 Starship Troopers(树形背包)
Starship Troopers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20833 Accepted Submission(s):
5550
Problem Description
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.
Input
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.
Output
sum of all the possibilities of containing brains for the taken rooms.
Sample Input
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
code
/*
hdu 1011
dp[i][j]:以i为根的树中,留下j个士兵,最大的收益。
*/
#include<cstdio>
#include<algorithm>
#include<cstring> using namespace std; const int MAXN = ; struct Edge{
int to,nxt;
}e[];
int head[],tot;
int val[MAXN],bg[MAXN],dp[MAXN][MAXN];
bool vis[MAXN];
int n,m; inline int read() {
int x = ,f = ;char ch = getchar();
for (; ch<''||ch>''; ch = getchar())
if (ch=='-') f = -;
for (; ch>=''&&ch<=''; ch = getchar())
x = x*+ch-'';
return x*f;
}
inline void add_edge(int u,int v) {
e[++tot].to = v,e[tot].nxt = head[u],head[u] = tot;
}
inline void init() {
memset(head,,sizeof(head));
memset(vis,false,sizeof(vis));
memset(dp,,sizeof(dp));
tot = ;
}
void dfs(int u) {
int tmp = (bg[u]+)/; // 对于当前点留下多少士兵
for (int i=tmp; i<=m; ++i) dp[u][i] = val[u]; // 留下tmp个以及tmp+1...都是一样的
vis[u] = true;
for (int i=head[u]; i; i=e[i].nxt) {
int v = e[i].to;
if (vis[v]) continue; // 不能搜回去
dfs(v);
for (int j=m; j>=tmp; --j)
for (int k=; k<=j-tmp; ++k)
dp[u][j] = max(dp[u][j],dp[u][j-k]+dp[v][k]);
}
}
int main() { while (scanf("%d%d",&n,&m)!=EOF && (n!=-||m!=-)) {
init();
for (int i=; i<=n; ++i) {
bg[i] = read(), val[i] = read();
}
for (int u,v,i=; i<n; ++i) {
u = read(),v = read();
add_edge(u,v),add_edge(v,u); // 当前不知道谁是谁的父亲儿子
}
if (m==) { // 别忘了特判,有这样的数据!!!
printf("0\n");continue;
}
dfs();
printf("%d\n",dp[][m]);
}
return ;
}
hdu 1011 Starship Troopers(树形背包)的更多相关文章
- hdu 1011 Starship Troopers 树形背包dp
Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Other ...
- HDU 1011 Starship Troopers 树形+背包dp
http://acm.hdu.edu.cn/showproblem.php?pid=1011 题意:每个节点有两个值bug和brain,当清扫该节点的所有bug时就得到brain值,只有当父节点被 ...
- hdu 1011 Starship Troopers(树形DP入门)
Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Other ...
- hdu 1011 Starship Troopers(树上背包)
Problem Description You, the leader of Starship Troopers, are sent to destroy a base of the bugs. Th ...
- [HDU 1011] Starship Troopers (树形dp)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1011 dp[u][i]为以u为根节点的,花了不超过i元钱能够得到的最大价值 因为题目里说要访问子节点必 ...
- HDU 1011 Starship Troopers 树形DP 有坑点
本来是一道很水的树形DP题 设dp[i][j]表示,带着j个人去攻打以节点i为根的子树的最大收益 结果wa了一整晚 原因: 坑点1: 即使这个节点里面没有守卫,你如果想获得这个节点的收益,你还是必须派 ...
- HDU 1011 Starship Troopers【树形DP/有依赖的01背包】
You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built unde ...
- hdu 1011(Starship Troopers,树形dp)
Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...
- hdu 1011 Starship Troopers 经典的树形DP ****
Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Other ...
随机推荐
- Spring Bean的一生
Spring Bean的一生 When you work directly in Java, you can do anything you like with your objects and do ...
- 只用jsp实现同样的Servlet功能
Jsp最终都会转化成java形式的Servlet执行,因此也可以说Jsp的本质就是Servlet,在jsp执行后,会在服务器上(例如tomcat中)生成.java以及.class文件.具体执行过程如下 ...
- [20190618]日常学习记录(二)-flex属性及vue实战
早上在看flex属性,总结一下它的优缺点 为什么使用flex, 她和浮动相比,代码更少.浮动要考虑左浮动右浮动,有时还要去清除浮动.flex一行代码就搞定了. 她更灵活,实现平均分配,根据内容大小分配 ...
- Outlook 客户端无法通过 MAPI over HTTP协议 连接
随着Exchange 版本更新升级,是否进行验证客户端建立MapiHttp连接所需的服务器设置已正确配置.即使服务器,负载均衡器和反向代理的所有设置都正确,您可能会遇到连接到Exchange Serv ...
- UI EventSystem事件监听
Unity5.0 EventSystem事件系统的详细说明 一.EventSystem对象的说明 当我们在场景中创建任一UI对象后,Hierarchy面板中都可以看到系统自动创建了对象EventSys ...
- UVALive 4329 Ping pong (BIT)
枚举中间的人,只要知道在这个人前面的技能值比他小的人数和后面技能值比他小的人数就能计算方案数了,技能值大的可有小的推出. 因此可以利用树状数组,从左到右往树上插点,每个点询问sum(a[i]-1)就是 ...
- MFC:DISP_FUNCTION 参数
/*#include <afxdisp.h>DISP_FUNCTION( theClass, pszName, pfnMember, vtRetVal, vtsParams )参数:the ...
- Angular-constructor和ngOnInit区别
参考文档:https://blog.csdn.net/u010730126/article/details/64486997 总结:constructor做依赖注入,避免业务操作: ngOninit做 ...
- 酷炫的3D照片墙
今天给大家分享的案例是酷炫的3D照片墙 这个案例主要是通过 CSS3 和原生的 JS 来实现的,接下来我给大家分享一下这个效果实现的过程.博客上不知道怎么放本地视频,所以只能放两张效果截图了. 1.实 ...
- 关于bc中小数点length,scale,(())以及进制转换
这是我在codewar上遇到的一个题,我用我自己的方法做出了解答,如下: 1 #!/bin/bash 2 3 distance=`echo "$1*10000"|bc|cut -d ...