[UVA10817] Headmaster's Headache && 状压DP

第一道状压DP题 感觉很难搞所以看了看代码 越看越觉得LRJ牛逼 我开始还想用fgets搞 要是那么搞估计得累死 STL大琺好 

好吧 说正题 = = 一开始没读清楚题目以为一个老师只能教一门课 结果居然都可以教 那其实还是挺好说的 

好吧 = = 其实不算难

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<iostream>
#include<sstream>
using namespace std;
const int MAXN = 150;
const int MAXS = 8;
const int INF = 0x3f3f3f3f;
int n, m, T;
int d[MAXN+10][(1 << MAXS) + 10][(1 << MAXS) + 10], c[MAXN+10], st[MAXN+10];
string s;
int dp(int i, int S, int S1, int S2)
{
	if(i == m + n)
		return (S2 == ((1 << T) - 1) ? 0 : INF);
	int &ans = d[i][S1][S2];
	if(ans >= 0) return ans;
	ans = INF;
	if(i >= m) ans = dp(i+1, S, S1, S2);
	int All = st[i] & S, Once = st[i] & S1;
	S ^= All;
	S1 = (S1 ^ Once) | All;
	S2 |= Once;
	ans = min(ans, c[i] + dp(i+1, S, S1, S2));
	return ans;
}
int main()
{
	int x;
	while(getline(cin, s))
	{
		stringstream ss(s);
		ss >> T >> m >> n;
		if(!(T + m + n)) break;
		for(int i = 0; i < m + n; i++)
		{
			getline(cin, s);
			stringstream ss(s);
			ss >> c[i];
			st[i] = 0;
			while(ss >> x) 
				st[i] |= (1 << (x-1));
		}
		memset(d, -1, sizeof(d));
		cout << dp(0, (1 << T)-1, 0, 0) << '\n';
	}
}