消灭怪兽吃东西
题目描述:
给出一棵树树,每个节点有一些东西需要消灭,消灭后节点上有一个概率值,树形依赖,手中1个士兵可以消灭20个东西,但是一个士兵只能放在一个地方.问手上的士兵最多可以搞到的最大的概率
题解:
其实就是树形依赖背包.不知道为什么就是过不了…..
重点:
代码:
//过不了的代码.....回头再看吧= =
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <ctype.h>
#include <limits.h>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#define CLR(a) memset(a, 0, sizeof(a))
#define REP(i, a, b) for(int i = a;i < b;i++)
#define REP_D(i, a, b) for(int i = a;i <= b;i++)
typedef long long ll;
using namespace std;
const int maxn = 100 + 10;
const int MIN = -1e8;
int val[maxn], dp[maxn][maxn], cost[maxn];
int tot, n;
vector<int> G[maxn];
void dfs_old(int u, int fa)
{
REP(i, 0, G[u].size())
{
int v = G[u][i];
if(v!=fa)
{
for(int j = cost[v];j <= tot;j++)
{
if(dp[u][j-cost[v]]!=MIN)
{
dp[v][j] = dp[u][j-cost[v]] + val[v];
}
else
{
dp[v][j] = MIN;
}
}
for(int j = 0;j < cost[v];j++)
{
dp[v][j] = MIN;
}
dfs_old(v, u);
for(int j = 0;j <= tot;j++)
{
dp[u][j] = max(dp[u][j], dp[v][j]);
}
}
}
}
void dfs(int u, int fa)
{
for(int i = tot;i >= cost[u];i--)
{
if(dp[u][i-cost[u]] != MIN)
{
dp[u][i] = dp[u][i-cost[u]] +val[u];
}
else
{
dp[u][i] = MIN;
}
}
for(int i = cost[u] - 1;i >= 0;i--)
{
dp[u][i] = MIN;
}
REP(i, 0, G[u].size())
{
int v = G[u][i];
if(v != fa)
{
for(int j = 0;j <= tot;j++)
{
dp[v][j] = dp[u][j];
}
dfs(v, u);
for(int j = 0;j <= tot;j++)
{
dp[u][j] = max(dp[u][j], dp[v][j]);
}
}
}
}
void solve()
{
if(tot == 0)
{
printf("0\n");
return;
}
for(int i = 0;i <= tot;i++)
{
dp[1][i] = MIN;
}
dp[1][0] = 0;
dfs(1, 0);
int ans = 0;
for(int i = 0;i <= tot;i++)
{
ans = max(ans, dp[1][i]);
}
printf("%d\n", ans);
}
int main()
{
freopen("8Hin.txt", "r", stdin);
//freopen("1Aout.txt", "w", stdout);
while(scanf("%d%d", &n, &tot) != EOF)
{
if(n==-1&&tot==-1)
{
break;
}
REP_D(i, 1, n)
{
G[i].clear();
int a, b;
scanf("%d%d", &a, &b);
cost[i] = (a+19)/20;
val[i] = b;
}
REP_D(i, 1, n-1)
{
int a, b;
scanf("%d%d", &a, &b);
G[a].push_back(b);
G[b].push_back(a);
}
solve();
}
return 0;
}
过了的代码,利用的是最笨的更新方式,并且采用dp[i]是初始化0的情况.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <ctype.h>
#include <limits.h>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#define CLR(a) memset(a, 0, sizeof(a))
#define REP(i, a, b) for(int i = a;i < b;i++)
#define REP_D(i, a, b) for(int i = a;i <= b;i++)
typedef long long ll;
using namespace std;
const int maxn = 100 + 10;
int val[maxn], dp[maxn][maxn], cost[maxn];
int tot, n;
vector<int> G[maxn];
void dfs_2(int u, int fa)
{
for(int i = cost[u]; i <= tot; i++)
dp[u][i] = val[u];
REP(i, 0, G[u].size())
{
int v = G[u][i];
if(v!=fa)
{
dfs_2(v, u);
for(int j=tot; j>=cost[u]; j--)
{
for(int k=1; k<=j - cost[u]; k++)
{
dp[u][j]=max(dp[u][j],dp[u][j-k]+dp[v][k]);
}
}
}
}
}
void solve()
{
// for(int i = 0; i <= tot; i++)
// {
// dp[1][i] = -1;
// }
if(tot==0)
{
printf("0\n");
return;
}
// dp[1][cost[1]] = val[1];
CLR(dp);
dfs_2(1, 0);
int ans = 0;
for(int i = 0; i <= tot; i++)
{
ans = max(ans, dp[1][i]);
}
printf("%d\n", ans);
}
int main()
{
freopen("9Iin.txt", "r", stdin);
//freopen("1Aout.txt", "w", stdout);
while(scanf("%d%d", &n, &tot) != EOF)
{
if(n==-1&&tot==-1)
{
break;
}
REP_D(i, 1, n)
{
G[i].clear();
int a, b;
scanf("%d%d", &a, &b);
cost[i] = (a+19)/20;
val[i] = b;
}
REP_D(i, 1, n-1)
{
int a, b;
scanf("%d%d", &a, &b);
G[a].push_back(b);
G[b].push_back(a);
}
solve();
}
return 0;
}