hdu5713 K个联通块[2016百度之星复赛B题]

#include<cstdio>
const int N = 30000;
const int P = 1000000009;
int n,m,k,cnt
;
long long f
,g
,o
,dp
[15];
int e[15][15],i,j,l,a,b;
int check(int x,int y)
{
int i;
for (i=0;i<n;i++)
if ((1<<i)==x) break;
int tmp=i,ans=0;
for (i=0;i<n;i++)
if (((1<<i)|y)==y)
ans+=e[tmp][i];
return ans;
}
int main()
{
int test;
scanf("%d",&test);
for (int ii=1;ii<=test;ii++)
{
scanf("%d%d%d",&n,&m,&l);
o[0]=1;for (i=1;i<=500;i++) o[i]=o[i-1]*2%P;
for (i=0;i<n;i++)
for (j=0;j<n;j++)
e[i][j]=0;
for (i=1;i<=m;i++)
{
scanf("%d%d",&a,&b);
a--;b--;
e[a][b]++;
if (a!=b)
e[b][a]++;
}
for (i=1;i<(1<<n);i++)
cnt[i]=cnt[i-(i&-i)]+check(i&-i,i);
for (i=0;i<(1<<n);i++)
f[i]=g[i]=0;
for (i=1;i<(1<<n);i++)
{
j=i;
do
{
j=((j-1)&i);
if ((j|(i&-i))==j)
g[i]=(g[i]+g[i-j]*f[j])%P;
}
while (j!=i);
f[i]=(o[cnt[i]]-g[i])%P;
(g[i]+=f[i])%P;
}
for (i=1;i<(1<<n);i++)
for (k=1;k<=l;k++)
dp[i][k]=0;
dp[0][0]=1;
for (i=1;i<(1<<n);i++)
{
for (k=1;k<=l;k++)
{
j=i;
do
{
j=((j-1)&i);
if ((j|(i&-i))==j)
dp[i][k]=(dp[i][k]+dp[i-j][k-1]*f[j])%P;
}
while (j!=i);
}
}
printf("Case #%d:\n%I64d\n",ii,(dp[(1<<n)-1][l]+P)%P);
}
}