[HDU - 1864] 最大报销额 (01背包)

链接

http://acm.hdu.edu.cn/showproblem.php?pid=1864

题意

总共有$n$张发票，你需要去报销它们，但是有报销额度；每张发票给出了购买物品类型，以及对应消费价格，可以报销的发票为，购买物品只能包含$A、B、C$，并且每种物品消费不得超过$600$，总消费价格不得高于$1000$，问最多可以报销多少；

分析

  显然我们需要筛选掉一些无法报销的发票，对于可报销的发票，计算出它的报价的钱数；那么显然这是一个$01$背包（符合$01$背包模型），然后$01$背包；报销额度为背包容量，$dp[x]$表示前i张可报销发票，报销额度最大为$x$所最多可以报销的钱数，然后进行前$i-1$张发票到前i张发票的状态的转移与更新，转移方程为 d p [ i ] [ j ] = max ⁡ { d p [ i − 1 ] [ j ] , d p [ i − 1 ] [ j − v a l [ i ] ] + v a l [ i ] } ( j > = v a l [ i ] ) dp[i][j]=\max\{dp[i-1][j],dp[i-1][j-val[i]]+val[i]\}(j>=val[i]) dp[i][j]=max{dp[i−1][j],dp[i−1][j−val[i]]+val[i]}(j>=val[i])

代码

#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>

#define INF 0x7f7f7f7f
#define MAXN 100005
#define N 200005
#define P 2
#define MOD 99991

typedef long long ll;

namespace fastIO {
    #define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1<<22, stdin), p1 == p2) ? EOF : *p1++)
    char buf[(1 << 22)], *p1 = buf, *p2 = buf;
    inline int read() {
        char c = getchar(); int x = 0, f = 1;
        while (c < '0' || c > '9') { if (c == '-') f = -1; c = getchar(); }
        while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
        return x * f;
    }
}

using namespace fastIO;
using namespace std;

/*struct Tree {
    int l, r, max;
} tree[4 * MAXN];

inline void push_up(int x) {
    tree[x].max = max(tree[x << 1].max, tree[x << 1 | 1].max);
}

inline void build(int x, int l, int r) {
    tree[x].l = l, tree[x].r = r;
    if (l == r) {
        tree[x].max = 0;
        return;
    }
    int mid = (l + r) >> 1;
    build(x << 1, l, mid);
    build(x << 1 | 1, mid + 1, r);
    push_up(x);
}

inline void update(int x, int pos, int val) {
    int l = tree[x].l, r = tree[x].r;
    if (l == r) {
        tree[x].max = max(tree[x].max, val);
        return;
    }
    int mid = (l + r) >> 1;
    if (pos <= mid)update(x << 1, pos, val);
    else update(x << 1 | 1, pos, val);
    push_up(x);
}

inline int query(int x, int l, int r) {
    int le = tree[x].l, ri = tree[x].r;
    if (l <= le && ri <= r) {
        return tree[x].max;
    }
    int mid = (le + ri) >> 1;
    int maxm = 0;
    if (l <= mid) maxm = max(maxm, query(x << 1, l, r));
    if (r > mid) maxm = max(maxm, query(x << 1 | 1, l, r));
    return maxm;
}*/

int  n, v[54];
char t;
int dp[5000007];
double x;
int main() {
    while (cin >> x >> n && n) {
        int cnt = 0;
        memset(dp, 0, sizeof(dp));
        memset(v, 0, sizeof(v));
        for (int i = 1; i <= n; i++) {
            int flag = 0, m;
            double sum = 0, p;
            cin >> m;
            double va = 0, vb = 0, vc = 0;
            for (int j = 1; j <= m; j++) {
                scanf(" %c:%lf", &t, &p);
                if (t == 'A')
                    va += p;
                else if (t == 'B')
                    vb += p;
                else if (t == 'C')
                    vc += p;
                else
                    flag = 1;
            }
            if (!flag && va <= 600 && vb <= 600 && vc <= 600 && va + vb + vc <= 1000)
                v[++cnt] = (int)((va + vb + vc) * 100);
        }
        for (int i = 1; i <= cnt; i++)
            for (int j = (int)(x * 100); j >= v[i]; j--)
                dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
        printf("%.2lf\n", dp[(int)(x * 100)] * 1.0 / 100.0);
    }

}