【vijos 1059 积木城堡 】背包

vijos 1059
题意 就是问 n 个背包都能组成的体积
那么用 dp[i][v] 代表第 i 个背包能组成的体积
然后 O(10000*100)地去check 就行

/*
    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
}*/
int v[105][105],dp[105][10025];
bool cmp(int a,int b)
{
    return a >b;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i = 1;i<=n;++i)
    {
        int tmp,sum = 0;
        while(scanf("%d",&tmp)&&tmp!=-1)
        {
            v[i][0]++;
            v[i][v[i][0]] = tmp;
            sum+=v[i][v[i][0]];
        }
        sort(v[i]+1,v[i]+1+v[i][0],cmp);
        dp[i][0] = 1;
        for(int j = 1;j<=v[i][0];++j)
        {
            for(int k = sum;k>=v[i][j];k--)
            {
                dp[i][k] = dp[i][k] | dp[i][k-v[i][j]];
            }
        }
    }
    int ans = 0;
    for(int i = 10000;i>=0;i--)
    {
        bool flag = true;
        for(int j = 1;j<=n;++j)
        {
            if(dp[j][i]!=1)
            {
                flag = false;
                break;
            }
        }
        if(flag)
        {
            ans = i;
            break;
        }
    }
    printf("%d\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}