hdu-1011
发布日期:2022-02-02 02:58:05 浏览次数:1 分类:技术文章

本文共 3402 字,大约阅读时间需要 11 分钟。

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
{
int to=e[p][i];
if(vis[to])continue;
dfs(to);
for(int j=m;j>=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
{
cin>>a>>b;
e[a].push_back(b);//把b放到a的后面
e[b].push_back(a);
}
if(m==0)
{
cout<<0<
continue;
}
dfs(1);
cout< <
}
return 0;}



转载地址:https://blog.csdn.net/u010368749/article/details/14387203 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:旅行社的烦恼
下一篇:hdu-The more, The Better

发表评论

最新留言

能坚持,总会有不一样的收获!
[***.36.148.184]2022年06月19日 02时07分39秒

关于作者

    喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!

最新文章

选择排序——堆排序 2019-07-26 18:46:27
选择排序 - 直接选择排序 2019-07-26 18:46:27
Java Threads 多线程10分钟参考手册 2019-07-26 18:46:26
团队需要的六种人 2019-07-26 18:46:26
iPhone开发【二十四】数据持久化总结之第4篇—sqlite3数据库 2019-07-26 18:46:25
iPhone开发【二十三】常用IOS开源组件【第1篇】 2019-07-26 18:46:24
iPhone开发【二十二】数据持久化总结之第3篇—归档(NSKeyedArchiver、NSKeyedUnarchiver) 2019-07-26 18:46:24
iPhone开发【二十一】数据持久化总结之第2篇—属性文件(.plist) 2019-07-26 18:46:23
iPhone开发【二十】数据持久化总结之第1篇—NSUserDefaults 2019-07-26 18:46:23
iPhone开发【十九】XML解析之NSXMLParser(使用Web Services查询火车信息) 2019-07-26 18:46:22
iPhone开发【十八】自定义视图之ActionSheet中使用PickerView 2019-07-26 18:46:21
散步 —— 莫怀戚 2019-07-26 18:46:21
iPhone开发【十七】多线程开发之NSOperation&NSOperationQueue——异步下载图片 2019-07-26 18:46:20
iPhone开发【十六】实现点击一个UIImageView时打开键盘 2019-07-26 18:46:20
iPhone开发【十五】多线程开发之NSThread——异步下载图片 2019-07-26 18:46:19
iPhone开发【十四】多线程开发之NSThread——子线程模拟耗时操作 2019-07-26 18:46:18
iPhone开发【十三】动画效果之最简单的动画——动态加载图片 2019-07-26 18:46:18
iPhone开发【十二】多视图技术总结之四:Segmented Control 2019-07-26 18:46:17
iPhone开发【十一】多视图技术总结之四:Page Control 2019-07-26 18:46:16
setValue:forUndefinedKey:]: this class is not key value coding-compliant for the key 2019-07-26 18:46:16