【HDOJ】2809 God of War

状态DP。

 /* 2809 */
 #include <iostream>
 #include <queue>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <algorithm>
 using namespace std;

 #define MAXN 20

 typedef struct {
     int a, d, h, e;
 } hero_t;

 hero_t hero[MAXN];
 int dp[<<MAXN];
 int exp[<<MAXN];
 int mask[MAXN];
 bool visit[<<MAXN];
 char name[];
 queue<int> Q;

 int main() {
     int n, m, size;
     int la, ld, lh;
     int ia, id, ih;
     int ra, rb, ha, hb;
     int i, j, k, tmp;
     int s, ss;
     int slev, alev, dlev, hlev, sslev;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif

     mask[] = ;
     for (i=; i<MAXN; ++i)
         mask[i] = (mask[i-]<<);

     while (scanf("%d%d%d%d%d%d", &la,&ld,&lh, &ia,&id,&ih) != EOF) {
         scanf("%d", &n);
         for (i=; i<n; ++i)
             scanf("%s %d %d %d %d", name, &hero[i].a,&hero[i].d,&hero[i].h,&hero[i].e);
         m = <<n;
         memset(dp, , sizeof(int)*m);
         memset(visit, false, sizeof(bool)*m);
         dp[] = lh;
         exp[] = ;
         Q.push();
         visit[] = true;
         while (!Q.empty()) {
             s = Q.front();
             Q.pop();
             visit[s] = false;
             for (i=; i<n; ++i) {
                 if (s & mask[i])
                     continue;
                 ss = s | mask[i];
                 // calculate s-state level
                 slev = exp[s]/;
                 alev = la+slev*ia;
                 dlev = ld+slev*id;
                 // calculate hurt and round
                 ha = max(, alev-hero[i].d);
                 hb = max(, hero[i].a-dlev);
                 ra = (hero[i].h+ha-)/ha;
                 rb = (dp[s]+hb-)/hb;
                 if (ra > rb)
                     continue;    // LvBu Lose
                 exp[ss] = exp[s] + hero[i].e;
                 sslev = exp[ss]/;
                 // calculate new hp
                 tmp = dp[s] - (ra-)*hb + (sslev-slev)*ih;
                 dp[ss] = max(dp[ss], tmp);
                 if (visit[ss] == false) {
                     visit[ss] = true;
                     Q.push(ss);
                 }
             }
         }
         if (dp[m-])
             printf("%d\n", dp[m-]);
         else
             printf("Poor LvBu,his period was gone.\n");
     }

     return ;
 }