Headmaster's Headache UVA - 10817 

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<assert.h>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<sstream>
#include<stack>
#include<queue>
#include<string>
#include<bitset>
#include<algorithm>
#pragma warning(disable:4996)
#define me(s)  memset(s,0,sizeof(s))
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
const int maxn = 100 + 20 + 5;
const int maxs = 8;
const int INF = 1000000000;
int m, n, s, c[maxn], st[maxn], d[maxn][1 << maxs][1 << maxs];
int dp(int i, int s0, int s1, int s2)
{
	if (i == m + n) return s2 == (1 << s) - 1 ? 0 : INF;
	int &ans = d[i][s1][s2];
	if (ans >= 0) return ans;
	ans = INF;
	if (i >= m) ans = dp(i + 1, s0, s1, s2);
	int m0 = st[i] & s0, m1 = st[i] & s1;
	s0 ^= m0;
	s1 = (s1^m1) | m0;
	s2 |= m1;
	ans = min(ans, dp(i + 1, s0, s1, s2) + c[i]);
	return ans;
}
int main() {
	int x;
	string line;
	while (getline(cin, line)) {
		stringstream ss(line);
		ss >> s >> m >> n;
		if (s == 0) break;

		for (int i = 0; i < m + n; i++) {
			getline(cin, line);
			stringstream ss(line);
			ss >> c[i];
			st[i] = 0;
			while (ss >> x) st[i] |= (1 << (x - 1));
		}
		memset(d, -1, sizeof(d));
		cout << dp(0, (1 << s) - 1, 0, 0) << "\n";
	}
}