Ural 1326

PRO IS HERE

集合的动态规划。。。

code:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iostream>
using namespace std;

#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define bug puts("Fuck");
#define LL long long
#define pb push_back
#define mp make_pair

#define nMax 1010
#define eps 1e-8
#define inf 0x7fffffff

int n,m;
struct BB{
	int s,p;
}a[nMax];
int S;
int dp[2][1<<21];

int main(){
#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
#endif
	while(~scanf("%d",&n)){
		for(int i=0;i<n;i++) {
			scanf("%d",&a[i].p);
			a[i].s = 1<<i;
		}
		scanf("%d",&m);m+=n;
		for(int i=n;i<m;i++) {
			scanf("%d",&a[i].p);
			a[i].s=0;
			int t,u;scanf("%d",&t);
			while(t--){
				scanf("%d",&u);u--;
				a[i].s += (1<<u);
			}
		}
		int t,u;
		scanf("%d",&t);S=0;
		while(t--){
			scanf("%d",&u);u--;
			S += (1<<u);
		}
		memset(dp,-1,sizeof(dp));
		dp[0][0]=0;
		int cur=0;
		for(int i=0;i<m;i++) {
			for(int j=0;j<(1<<(n+1));j++) dp[cur^1][j]=dp[cur][j];
			for(int j=0;j<(1<<(n+1));j++)if(dp[cur][j]!=-1){
				int jj=j|a[i].s;
				if(dp[cur^1][jj]==-1 || dp[cur^1][jj]>dp[cur][j]+a[i].p) dp[cur^1][jj] = dp[cur][j] + a[i].p;
			}
			cur^=1;
		}
		int ans = inf;
		for(int i=0;i<(1<<(n+1));i++)if(dp[cur][i]!=-1){
			if((i&S)==S && dp[cur][i] < ans) {
			    ans = dp[cur][i];
		//	    printf("%d := %d\n",i,dp[cur][i]);
			}
		}
		printf("%d\n",ans);
	}

	return 0;
}