hdu 3182 状压dp

 

#include "bits/stdc++.h"
using namespace std;
int T;

int dp[40000];
int totene[40000];

int N, E;
int val[20], ene[20], cond[20];

const int INF = 0x3f3f3f3f;

int main()
{
    scanf("%d", &T);
    while(T--) {
        memset(cond, 0, sizeof(cond));
        memset(dp, 0xf3, sizeof(dp));
        dp[0] = 0;
        scanf("%d%d", &N, &E);
        int res = 0;
        int i;
        for(i = 1; i <= N; ++i) {
            scanf("%d", &val[i]);
        }
        for(i = 1; i <= N; ++i) {
            scanf("%d", &ene[i]);
        }
        int M, item;
        for(i = 1; i <= N; ++i) {
            scanf("%d", &M);
            while(M--) {
                scanf("%d", &item);
                cond[i] |= (1 << (item - 1));
            }
        }
        int tot_s = (1 << N) - 1;
        int s, step_s, pre_s;
        for(s = 1; s <= tot_s; ++s) {
            for(item = 1; item <= N; ++item) {

                step_s = (1 << (item - 1));
                pre_s = s ^ step_s;
                if(dp[pre_s] < 0) {
                    continue;
                }

                if((step_s & s) && ((pre_s & cond[item]) == cond[item])) {
//                    if(dp[s] == INF) {
                    totene[s] = totene[pre_s] + ene[item];
//                    }
                    dp[s] = max(dp[s], dp[pre_s] + val[item]);
                    if(totene[s] <= E) {
                        res = max(res, dp[s]);
                    }
                    break;
                }
            }
        }
        printf("%d\n", res);
    }
}


//4
//4 4
//1 1 1 1
//1 1 1 1
//0
//1 1
//2 1 2
//3 1 2 3

//4
//4 4
//1 1 1 1
//1 1 1 1
//1 2
//1 1
//2 1 2
//3 1 2 3