【hdu】1011 Starship Troopers【树形背包】

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/a709743744/article/details/52196965

【题意】:有一颗树,树的节点编号为1-n,1为根节点,每个节点上会有x个敌人,y个宝藏,现在你从1号节点出发,率领m个友方单位,只有攻占了父节点才能继续攻占子节点,如果你在一个节点的兵力*20>=敌人数,你就可以得到这个节点中的宝藏,并且这些士兵就永久驻扎在这个节点了,并且所有士兵不能走回头路(注意这个条件非常重要,我在这里WA了2次,这个条件就意味着,就算每个节点的敌人数量都是0,也至少需要一个士兵才能获得宝藏,并且这个士兵只能选择树上的一条链走到底)

【题解】:主要是题目条件比较坑,其他的就是裸的树形背包,在树上进行背包,思想很简单dp[i][j]代表以i节点为根的子树派出兵力j所能得到最多的宝藏数  

递推式dp[u][j]=max(dp[u][j],dp[u][j-k]+dp[v][k])

其中u为父节点 j为给以u为根的子树分配的兵力数 v为子节点 k为分配给以v为根节点的子树的兵力  

其中只有攻占了父节点才能继续攻占子节点这个条件,只要在对每个点进行背包的时候强制留下w[u]个士兵即可(w[u]为攻占u节点所需要的士兵数)

其他细节看代码

#include<set>
#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define PB push_back
#define MP make_pair
#define ll __int64
#define MS(a,b) memset(a,b,sizeof(a))
#define LL (rt<<1)
#define RR (rt<<1|1)
#define lson l,mid,LL
#define rson mid+1,r,RR
#define pii pair<int,int>
using namespace std;
const int MAXN=1e2+10;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
int dp[MAXN][MAXN];
int w[MAXN],val[MAXN];
int m;
vector<int>G[MAXN];
void dfs(int u,int fa)
{
    for(int j=w[u];j<=m;j++)dp[u][j]=val[u];//初始化 因为必须要先攻下父节点才能往子节点走 所有父节点是必须要取得
    for(int i=0;i<G[u].size();i++){
        int v=G[u][i];
        if(v==fa)continue;
        dfs(v,u);
        for(int j=m;j>=w[u];j--)//枚举在u及其子树的派兵量 倒着枚举是和背包一样 防止重复使用
            for(int k=1;k<=j-w[u];k++)//枚举分配给v及其子树的士兵量 因为至少有一个士兵才能有得到大脑 不管敌人数量是不是0 
                dp[u][j]=max(dp[u][j],dp[u][j-k]+dp[v][k]);//上限是j-w[u]是因为u节点必须要攻占 
    }
}
int main()
{//freopen("C:\\Users\\Administrator\\Desktop\\input.txt","r",stdin);
    int n;
    while(scanf("%d%d",&n,&m),n!=-1||m!=-1){
        MS(dp,0);
        for(int i=1;i<=n;i++){
            int tmp;
            scanf("%d%d",&tmp,&val[i]);
            w[i]=(tmp+19)/20;//算攻占一个洞穴需要几个士兵
            G[i].clear();
        }
        for(int i=1;i<n;i++){
            int u,v;
            scanf("%d%d",&u,&v);
            G[u].PB(v);G[v].PB(u);
        }
        if(m==0){printf("0\n");continue;}//至少要有人才能拿到大脑
        dfs(1,-1);
        printf("%d\n",dp[1][m]);
    }
    return 0;
}


Starship Troopers

06-11

Problem DescriptionnYou, 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.nnTo 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.nnA 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.n nnInputnThe 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.nnThe last test case is followed by two -1's.n nnOutputnFor each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.n nnSample Inputn5 10n50 10n40 10n40 20n65 30n70 30n1 2n1 3n2 4n2 5n1 1n20 7n-1 -1n nnSample Outputn50n7

没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭