题意:有N个灯和M个开关,每个开关控制着一些灯,如果按下某个开关,就会让对应的灯切换状态;问在每个开关按下与否的一共2^m情况下,每种状态下亮灯的个数的立方的和。
思路:1、首先注意到N<=50,M<=50,因此很容易想到状压;
2、最开始考虑的是算出每种情况下对应的方案数,然后依次dp,但是数据量太大;
3、正解是直接考虑X^3,其中X就是每种状况下亮着的灯的数量;
4、如何解这个X^3?我们把它展开——
X=x1+x2+x3+...+xn,其中xi是第i个灯的亮或暗状况;
因此X^3=(x1+x2+x3+...+xn)*(x1+x2+x3+...+xn)*(x1+x2+x3+...+xn)=Σxi*xj*xk (1<=i<=j<=k<=n);
5、dp[m][state]代表前m个开关,达成状态为state的方案数,其中state从(000)2~(111)2,代表三个灯的亮或灭;在其基础上dp就行了;
6、答案每次加上dp[m][7],因为只有xi=xj=xk=1时,才对X^3有贡献,总复杂度O(n^3*m);
#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cctype>
#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<set>
#include<algorithm>
#include<stack>
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
#define INF 0x7fffffff
#define ll long long
#define eps 1e-5
#define PI 2.0*acos(0.0)
#define MOD 1000000007
#define MAXN 10005
ll d[51][8];
ll s[51];
int main()
{
int n, m;
int T;
int kase = 0;
scanf("%d", &T);
while (T--)
{
scanf("%d%d", &n, &m);
mem(s, 0);
for (int i = 1; i <= m; i++)
{
int num;
scanf("%d", &num);
for (int j = 1; j <= num; j++)
{
int tmp;
scanf("%d", &tmp);
s[i] |= (ll)1 << tmp;
}
}
ll ans = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
for (int k = 1; k <= n; k++)
{
mem(d, 0);
d[0][0] = 1;
for (int x = 1; x <= m; x++)
{
for (int y = 0; y < 8; y++)
{
int tmp = y;
if (s[x] & (1LL << i)) tmp ^= 1;
if (s[x] & (1LL << j)) tmp ^= 2;
if (s[x] & (1LL << k)) tmp ^= 4;
d[x][y] += d[x - 1][y]; //这个开关不开
d[x][tmp] += d[x - 1][y]; //这个开关打开
}
}
ans = (ans + d[m][7]) % 1000000007;
}
}
}
printf("Case #%d: %lld\n", ++kase, ans);
}
return 0;
}