ACM-ICPC 2018 南京赛区网络预赛 E AC Challenge（状压dp）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ms(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define eps 0.0000000001
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define random(a, b) rand()*rand()%(b-a+1)+a
#define ne S, T, w, opi acos(-1)
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
const int maxn = (1<<20) +10;
const int maxm = 1e6 +10;
const int mod = 100000007;
int n, m, k;
struct point{
    int a,b,k;
    int f;
}p[25];
ll dp[maxn];
int num[maxn];
int bit[maxn];
int main(){
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endif
    int n,tmp;
    scanf("%d",&n);
    for(int i=0;i<=n;i++) bit[i]=1<<i;
    for(int i=0;i<(1<<n);i++){
        num[i]=__builtin_popcount(i);
    }
    for(int i=0;i<n;i++) {
        scanf("%d%d%d",&p[i].a,&p[i].b,&p[i].k);
        p[i].f=0;
        for(int j=0;j<p[i].k;j++) {
            scanf("%d",&tmp);
//            p[i].f|=(1<<(tmp-1));
            p[i].f|=bit[tmp-1];
        }
    }
    ll ans=0;
    memset(dp,-inf,sizeof(dp));
    dp[0]=0;
    for(int i=0;i<bit[n];i++){
        if(dp[i]==-inf) continue;
        ans=max(ans,dp[i]);
        for(int j=0;j<n;j++){
            if(i&bit[j]) continue;
            if((i&p[j].f)!=p[j].f) continue;
            dp[i|bit[j]]=max(dp[i|bit[j]],dp[i]+1ll*(num[i]+1)*p[j].a+p[j].b);
        }
    }
//    cout<<ans<<endl;
    printf("%lld\n",ans);
    return 0;
}