Survival (状态dp)
2017-12-10 20:15
148 查看
The King of Fighter 97 (KOF97) is an electronic game of wrestling type. Once it was fashionable among youths. The game is amused. However, playing by oneself is not as excited as with friends. Getting bored? Maybe you can alter to the survival mode.
In the survival mode, you play as usual, but under quite unfair conditions: you must use your only character to beat all the other characters and Orichi as well (who is the BOSS)!!! How can you do that? We know that usually we will consume some HP of the
character to beat one opponent. Although the character will recover some HP after beating one opponent, the amount of HP recovered is affected by the time you used, so it��s possible that the character lose some HP after one round. What��s worse, if the HP
of your character is not enough for you to beat your opponent, you lose!
Given the HP of your character you need to consume and the HP your character will recover if you win for every opponent, you are to determine whether you can clear the game.
NOTE:
1. The initial HP of your character is 100.
2. You can challenge your opponents in any order except that Orichi is always the last one.
3. If your HP falls BELOW zero after any fights (before recovery), you will get your mission failed. 4. Your HP should never exceed 100.
Input
There are multiple test cases, which are separated by a blank line. The first line of each test case is a single integer N (1 <= N <= 20), gives the number of opponents you need to beat. The following N �C 1 lines each contain two integers C and R (0 <= C,
R <= 100), where C for the HP you need to consume to beat the opponent and R for the HP recovered after you beat the opponent. The last line contains only one integer P (0 <= P <= 100), describing the HP you need to consume to beat Orichi.
<b< dd="">
Output
For each test case, generate one line of output: if you can clear the game, print "clear!!!" otherwise print "try again" (both without quotations).
<b< dd="">
Sample Input
3
50 50
40 40
70
<b< dd="">
Sample Output
clear!!!
题目大概:
你要击败n个敌人,击败每个敌人,需要花费血,并且能够恢复一部分生命值,最后击败boos,不回复生命值,问是否能够把敌人全部击败。
思路:
由于敌人数量比较少,可以用状态dp表示所有敌人的状态。
dp【i】状态为i时 的最大血量值。
代码注释
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int ma=22;
int dp[1<<ma];
int hua[ma],v[ma];
int end;
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n==0)break;
memset(dp,-1,sizeof(dp));
for(int i=0;i<n-1;i++)
{
scanf("%d%d",&hua[i],&v[i]);
}
scanf("%d",&end);
dp[0]=100;
int cnt=(1<<(n-1));
for(int j=1;j<cnt;j++)//枚举每一个状态
{
dp[j]=-9999;
for(int r1=0;(1<<r1)<=j;r1++)//枚举到达该状态的时候击败的敌人
{
int tem=1<<r1;
if(tem&j&&dp[j-tem]>=hua[r1])//该敌人在这种状态下能被击败,包含在状态里。
{
int ans=dp[j-tem]-hua[r1]+v[r1];
if(ans>100)ans=100;
if(ans>dp[j])dp[j]=ans;
}
}
}
if(dp[cnt-1]>=end)
printf("clear!!!\n");
else printf("try again\n");
}
return 0;
}
In the survival mode, you play as usual, but under quite unfair conditions: you must use your only character to beat all the other characters and Orichi as well (who is the BOSS)!!! How can you do that? We know that usually we will consume some HP of the
character to beat one opponent. Although the character will recover some HP after beating one opponent, the amount of HP recovered is affected by the time you used, so it��s possible that the character lose some HP after one round. What��s worse, if the HP
of your character is not enough for you to beat your opponent, you lose!
Given the HP of your character you need to consume and the HP your character will recover if you win for every opponent, you are to determine whether you can clear the game.
NOTE:
1. The initial HP of your character is 100.
2. You can challenge your opponents in any order except that Orichi is always the last one.
3. If your HP falls BELOW zero after any fights (before recovery), you will get your mission failed. 4. Your HP should never exceed 100.
Input
There are multiple test cases, which are separated by a blank line. The first line of each test case is a single integer N (1 <= N <= 20), gives the number of opponents you need to beat. The following N �C 1 lines each contain two integers C and R (0 <= C,
R <= 100), where C for the HP you need to consume to beat the opponent and R for the HP recovered after you beat the opponent. The last line contains only one integer P (0 <= P <= 100), describing the HP you need to consume to beat Orichi.
<b< dd="">
Output
For each test case, generate one line of output: if you can clear the game, print "clear!!!" otherwise print "try again" (both without quotations).
<b< dd="">
Sample Input
3
50 50
40 40
70
<b< dd="">
Sample Output
clear!!!
题目大概:
你要击败n个敌人,击败每个敌人,需要花费血,并且能够恢复一部分生命值,最后击败boos,不回复生命值,问是否能够把敌人全部击败。
思路:
由于敌人数量比较少,可以用状态dp表示所有敌人的状态。
dp【i】状态为i时 的最大血量值。
代码注释
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int ma=22;
int dp[1<<ma];
int hua[ma],v[ma];
int end;
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n==0)break;
memset(dp,-1,sizeof(dp));
for(int i=0;i<n-1;i++)
{
scanf("%d%d",&hua[i],&v[i]);
}
scanf("%d",&end);
dp[0]=100;
int cnt=(1<<(n-1));
for(int j=1;j<cnt;j++)//枚举每一个状态
{
dp[j]=-9999;
for(int r1=0;(1<<r1)<=j;r1++)//枚举到达该状态的时候击败的敌人
{
int tem=1<<r1;
if(tem&j&&dp[j-tem]>=hua[r1])//该敌人在这种状态下能被击败,包含在状态里。
{
int ans=dp[j-tem]-hua[r1]+v[r1];
if(ans>100)ans=100;
if(ans>dp[j])dp[j]=ans;
}
}
}
if(dp[cnt-1]>=end)
printf("clear!!!\n");
else printf("try again\n");
}
return 0;
}
相关文章推荐
- ZOJ2297 Survival,压缩状态DP
- G - Survival (状态dp)
- ZOJ 2297 Survival (状态dp)
- ZOJ 2297 Survival 状态压缩DP
- 【算法学习笔记】67.状态压缩 DP SJTU OJ 1383 畅畅的牙签袋
- FZU 2218 Simple String Problem(状态压缩DP)
- 【算法设计与数据结构】URAL 1152.False Mirrors(状态压缩dp+dfs)
- 状态压缩DP(含poj3254)
- HDU5691 状态压缩dp
- lightoj 1011 (状态压缩dp)
- poj3254 状态压缩dp
- 【连通性状态压缩DP】poj1739
- 2018年全国多校算法寒假训练营练习比赛(第二场) F 德玛西亚万岁(状态压缩DP 未解决)
- hdu3471之状态压缩dp
- poj 1185 炮兵阵地 状态压缩DP
- hdu 3217 Health(状态压缩DP)
- POJ 3254 Corn Fields(状态压缩dp)
- 状态压缩DP--Mondriaan's Dream
- poj 2686 状态dp
- LA 4794 状态压缩dp