POJ 2441 Arrange the Bulls / 状态压缩DP

还是比较简单的 入门的DP

#include <cstdio>
#include <cstring>
const int maxn = 22;
int dp[2][1<<maxn];
int pre[1<<maxn];
int a[maxn][maxn];
int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i][0]);
		for(int j = 1; j <= a[i][0]; j++)
		{
			scanf("%d", &a[i][j]);
			a[i][j]--;
		}
	}
	for(int i = 1; i <= a[1][0]; i++)
		dp[1][1<<a[1][i]] = 1;
	int l = 1;
	int r = l^1;
	for(int i = 2; i <= n; i++)
	{
		l = r;
		r = l^1;
		//memcpy(pre, dp, sizeof(dp));
		memset(dp[l], 0, sizeof(dp[l]));
		for(int j = 1; j <= a[i][0]; j++)
		{
			int u = a[i][j];
			for(int k = 0; k < (1<<m); k++)
			{
				if(k & (1<<u))
					continue;
				dp[l][k|(1<<u)] += dp[r][k];				
			}
		}
	}
	int ans = 0;
	for(int i = 0; i < (1<<m); i++)
		ans += dp[l][i];
	printf("%d\n", ans);
	return 0;
}