hdu 3008 Warcraft（dp）

Warcraft

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1910    Accepted Submission(s): 1028

Problem Description

Have you ever played the Warcraft?It doesn't matter whether you have played it !We will give you such an experience.There are so many Heroes in it,but you could only choose one of them.Each Hero has his own skills.When such a Skill is used ,it costs some MagicValue,but hurts the Boss at the same time.Using the skills needs intellegence,one should hurt the enemy to the most when using certain MagicValue.

Now we send you to complete such a duty to kill the Boss(So cool~~).To simplify the problem:you can assume the LifeValue of the monster is 100, your LifeValue is 100,but you have also a 100 MagicValue!You can choose to use the ordinary Attack(which doesn't cost MagicValue),or a certain skill(in condition that you own this skill and the MagicValue you have at that time is no less than the skill costs),there is no free lunch so that you should pay certain MagicValue after you use one skill!But we are good enough to offer you a "ResumingCirclet"(with which you can resume the MagicValue each seconds),But you can't own more than 100 MagicValue and resuming MagicValue is always after you attack.The Boss is cruel , be careful!

 

Input

There are several test cases,intergers n ,t and q (0<n<=100，1<=t<=5，q>0) in the first line which mean you own n kinds of skills ,and the "ResumingCirclet" helps you resume t points of MagicValue per second and q is of course the hurt points of LifeValue the Boss attack you each time(we assume when fighting in a second the attack you show is before the Boss).Then n lines follow,each has 2 intergers ai and bi(0<ai,bi<=100).which means using i skill costs you ai MagicValue and costs the Boss bi LifeValue.The last case is n=t=q=0.

 

Output

Output an interger min (the minimun time you need to kill the Boss)in one line .But if you die(the LifeValue is no more than 0) ,output "My god"!

 

Sample Input

4 2 2510 520 1030 2876 704 2 2510 520 1030 2877 700 0 0

 

Sample Output

4My god

Hint

Hint:When fighting,you can only choose one kind of skill or just to use the ordinary attack in the whole second,the ordinary attack costs the Boss 1 points of LifeValue,the Boss can only use ordinary attack which costs a whole second at a time.Good Luck To You!

题意:怪物的血量有100，攻击力为q，你的初始血量和蓝都为100，普通攻击力为1（不消耗蓝）,使用技能造成的伤害需要蓝，每2s你会增加t点蓝值上限为100（你后者怪物攻击后算一秒），问至少几轮能杀死怪物，不能则输出My,god.

dp[i][j]，表示第i次攻击剩j点蓝值时造成的最大攻击。

dp[i][min(j+t, 100)] = max{dp[i-1][j+num[k]]+skill[k]};

#include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
#define XINF INT_MAX
#define INF 0x3F3F3F3F
#define MP(X,Y) make_pair(X,Y)
#define PB(X) push_back(X)
#define REP(X,N) for(int X=0;X<N;X++)
#define REP2(X,L,R) for(int X=L;X<=R;X++)
#define DEP(X,R,L) for(int X=R;X>=L;X--)
#define CLR(A,X) memset(A,X,sizeof(A))
#define IT iterator
#define RIT reverse_iterator
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<PII> VII;
typedef vector<int> VI;
typedef tree<PII, null_type, greater<PII>, rb_tree_tag, tree_order_statistics_node_update > rb_tree_set;
typedef tree<PII, PII, greater<PII>, rb_tree_tag, tree_order_statistics_node_update > rb_tree;
#define PQ std::priority_queue
#define HEAP __gnu_pbds::priority_queue
#define X first
#define Y second
#define lson(X) ((X)<<1)
#define rson(X) ((X)<<1|1)
#define N 110
#define M 200010
int skill[N], num[N];
int dp[N][N];
int main()
{
    int n, q, t;
    while(scanf("%d%d%d", &n, &t, &q) != EOF, n|q|t) {
        int times = 100/q + (100%q==0?0:1);
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= n; i++) {
            scanf("%d%d", &num[i], &skill[i]);
        }
        num[0] = 0;
        skill[0] = 1;
        dp[0][100] = 0;
        int pos=0;
        for(int i = 1; i <= times; i++) {
            for(int j = 0; j <= 100; j++) {
                int temp=(j+t)>100? 100:j+t; 
                for(int k = 0; k <= n; k++) {
                    if(j+num[k] <= 100) {
                        dp[i][temp] = max(dp[i][temp], dp[i-1][j+num[k]]+skill[k]);
                    }
                }
                if(dp[i][temp] >= 100) {
                    pos = i;
                    break;
                }
            }
            if(pos)
                break;
        }
        if(pos)
            printf("%d\n", pos);
        else
            printf("My god\n");
    }
    return 0;
}