G - Survival (状态dp)
2017-12-06 19:27
134 查看
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个Boss,其中有n-1个小boss必须先全部打完才能打第n个大BOSS,打一个小boss要耗体能use【i】,打完后恢复一部分val【i】,一开始体能为100,在打的过程中也最多为100,问能打完全部的BOSS? 能 输出clear!!! 否则输出try again.
思路:
状态dp,用dp[i]表示打完i状态剩余的最大体能
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
int n,use[25];
int val[25];
int b[1100000];
int main()
{
while(scanf("%d",&n)>0)
{
for(int i=0;i<n-1;i++)
scanf("%d%d",&use[i],&val[i]);
scanf("%d",&use[n-1]);
memset(b,-1,sizeof(b));
b[0]=100;
for(int i=1;i<(1<<(n-1));i++)
{
b[i]=-9999;
for(int j=0;(1<<j)<=i;j++)//在i状态中是最后一个打
if(i&(1<<j)&&b[i-(1<<j)]>=use[j])
{
int m=b[i-(1<<j)]-use[j]+val[j];
if(m>100)m=100;
if(m>b[i])b[i]=m;
}
}
if(b[(1<<(n-1))-1]>=use[n-1])
printf("clear!!!\n");
else printf("try again\n");
}
}
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个Boss,其中有n-1个小boss必须先全部打完才能打第n个大BOSS,打一个小boss要耗体能use【i】,打完后恢复一部分val【i】,一开始体能为100,在打的过程中也最多为100,问能打完全部的BOSS? 能 输出clear!!! 否则输出try again.
思路:
状态dp,用dp[i]表示打完i状态剩余的最大体能
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
int n,use[25];
int val[25];
int b[1100000];
int main()
{
while(scanf("%d",&n)>0)
{
for(int i=0;i<n-1;i++)
scanf("%d%d",&use[i],&val[i]);
scanf("%d",&use[n-1]);
memset(b,-1,sizeof(b));
b[0]=100;
for(int i=1;i<(1<<(n-1));i++)
{
b[i]=-9999;
for(int j=0;(1<<j)<=i;j++)//在i状态中是最后一个打
if(i&(1<<j)&&b[i-(1<<j)]>=use[j])
{
int m=b[i-(1<<j)]-use[j]+val[j];
if(m>100)m=100;
if(m>b[i])b[i]=m;
}
}
if(b[(1<<(n-1))-1]>=use[n-1])
printf("clear!!!\n");
else printf("try again\n");
}
}
相关文章推荐
- ZOJ2297 Survival,压缩状态DP
- ZOJ 2297 Survival 状态压缩DP
- ZOJ 2297 Survival (状态dp)
- Survival (状态dp)
- poj 2288 状态压缩dp
- HDU1074:Doing Homework(状态压缩DP)
- 【bzoj1260】 [CQOI2007]【区间DP】涂色paint 【一个空序列,每次可以将连续(注意这个条件)的一段染成同一颜色,问最少次才能到目标状态】
- 【bzoj1087】互不侵犯King 状态压缩dp
- poj - 1170 - Shopping Offers(状态压缩dp)
- HOJ 2317 Pimp My Ride(状态压缩DP)
- 【连通性状态压缩DP】poj1739
- POJ3254Corn Fields(状态压缩DP入门)
- HLG 1473 教主的遗产【状态压缩DP】
- hdu 1565 状态压缩 dp
- codeforces 8C - Looking for Order 状态DP
- HDU 1074 状态压缩dp
- POJ 2817 WordStack(状态压缩DP)
- poj 3254 Corn Fields (状态压缩dp)
- HDU 5816 Hearthstone(状态压缩DP+概率)
- HDU 3001 Travelling(状态压缩DP)