ZOJ 2297 Survival 【状态压缩】

Survival

---

Time Limit: 5 Seconds      Memory Limit: 32768 KB

---

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.

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).

Sample Input

3
50 50
40 40
70

Sample Output

clear!!!

典型的状态压缩。

#include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 using namespace std;
 int dp[1<<21];
 struct node{
    int use;
    int value;
 }t[21];
 int main()
 {
    int n;
    int consume;
    while(cin>>n)
    {
        for(int i=0;i<n-1;i++)
            scanf("%d %d",&t[i].use,&t[i].value);
        cin>>consume;
        memset(dp,-1,sizeof(dp));
        dp[0]=100;
        for(int i=1;i<=((1<<(n-1))-1);i++)
        {
            dp[i]=-1000;
            for(int j=0;(1<<j)-1<=i;j++)
            {
                if(i & (1<<j) && dp[i^(1<<j)]>=t[j].use)
                   {
                       int sum=dp[i-(1<<j)]-t[j].use+t[j].value;
                       if(sum>100)
                         sum=100;
                       if(sum>dp[i])
                         dp[i]=sum;
                   }
            }
        }
        if(dp[(1<<(n-1))-1]>=consume)
            printf("clear!!!\n");
        else
            printf("try again\n");
    }
    return 0;
 }