hdu-1011
发布日期:2022-02-02 02:58:05
浏览次数:19
分类:技术文章
本文共 3281 字,大约阅读时间需要 10 分钟。
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.
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.
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 1050 1040 1040 2065 3070 301 21 32 42 51 120 7-1 -1
Sample Output
507
题意是说有n个洞形成一棵树,你有m个士兵,每个洞都有一定数量的虫子和一定概率的首脑。每个士兵可以攻击20只虫子。而且想要攻击下面的洞的虫子,必须要攻击上层的虫子,问你花费这m个士兵,最多可以得到多少概率的首脑。
树形dp,每个洞的虫子代表空间,首脑代表价值,那么这就转换成了背包问题,在树上进行背包运算。
代码:
#include#include #include #include #define M 107using namespace std;vector e[M];int w[M],v[M],dp[M][M];bool vis[M];int n,m;void dfs(int p){ int tmp=(w[p]+19)/20; for(int i=tmp;i<=m;i++) dp[p][i]=v[p]; vis[p]=true; for(int i=0;i =tmp;j--)//背包 { for(int k=1;k<=(j-tmp);k++) dp[p][j]=max(dp[p][j],dp[p][j-k]+dp[to][k]); } }}int main(){ while(cin>>n>>m) { if(n==-1&&m==-1)break; for(int i=0;i<=n;i++) e[i].clear(); memset(vis,false,sizeof(vis)); memset(dp,0,sizeof(dp)); int a,b; for(int i=1;i<=n;i++) { cin>>w[i]>>v[i]; } for(int i=1;i >a>>b; e[a].push_back(b);//把b放到a的后面 e[b].push_back(a); } if(m==0) { cout<<0<
转载地址:https://blog.csdn.net/u010368749/article/details/14387203 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!
发表评论
最新留言
做的很好,不错不错
[***.243.131.199]2024年04月16日 23时04分43秒
关于作者
喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!
推荐文章
我的大二上学期
2019-04-26
安卓——eclipse真机连接问题解决1
2019-04-26
安卓——按钮的四种点击事件
2019-04-26
c语言基础语法三——数组
2019-04-26
链表操作——多项式加减乘
2019-04-26
安卓布局——注册页面
2019-04-26
链表的一些基础题
2019-04-26
c语言数据结构——三元数组的快速转置
2019-04-26
安卓中文件清单的配置举例
2019-04-26
listView简单使用和出现的一些问题
2019-04-26
安卓之TranslateAnimation图片移动
2019-04-26
简述Handler
2019-04-26
安卓——套接字Socket通信(未完)
2019-04-26
安卓——蓝牙listView搜索以及点击事件
2019-04-26
安卓——WIFI列表以及点击事件
2019-04-26
安卓——WIFI连接
2019-04-26
安卓——关于一些ui界面设置(直续更新ing)
2019-04-26
刷门禁——判断卡号是否一样(String==String)出现False
2019-04-26
好久没刷题了(阿里测试题)
2019-04-26
安卓界面——最开始界面的加载
2019-04-26