【hdu 6082 度度熊与邪恶大魔王 】 完全背包

hdu 6082
这道题一拿过来 对一个熊直接跑完全背包 然后跑 100000 次 完美TLE
其实因为对一个熊跑的时候 下次熊还是会跑的
于是需要对所有的熊直接完全背包预处理
设 dp[i][j] 代表 消灭护甲为 i 血量为 j 的怪兽的最小代价
那么只要O(n) 遍历这些怪兽是否能被消灭即可

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 1025;
int a[100025],b[100025],k[MAX_N],p[MAX_N],dp[11][MAX_N];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m;
    while(scanf("%d%d",&n,&m)==2)
    {
        bool flag = true;
        int mxa = 0,mxb = 0;
        long long ans = 0;
        for(int i = 1;i<=n;++i)
            scanf("%d%d",&a[i],&b[i]),mxa = max(mxa,a[i]),mxb = max(mxb,b[i]);
        for(int i = 1;i<=m;++i)
            scanf("%d%d",&k[i],&p[i]);
        memset(dp,0x3f,sizeof(dp));
        for(int i = 0;i<=mxb;++i) dp[i][0] = 0;
        for(int i = 0;i<=mxb;++i)
        {
            for(int j = 1;j<=m;++j)
            {
                if(p[j]-i<=0) continue;
                for(int l = 1;l<=mxa;++l)
                {
                    if(l-(p[j]-i)>=0) dp[i][l] = min(dp[i][l],dp[i][l-(p[j]-i)]+k[j]);
                    else dp[i][l] = min(dp[i][l],dp[i][0]+k[j]);
                }
            }
        }
        for(int i = 1;i<=n;++i)
        {
            if(dp[b[i]][a[i]]==inf) flag = false;
            else ans+=dp[b[i]][a[i]];
        }
        if(flag) printf("%lld\n",ans);
        else printf("-1\n");
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}