mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
56 lines
1018 B
C++
56 lines
1018 B
C++
|
#include"stdio.h"
|
||
|
#include"string.h"
|
||
|
#include"stdlib.h"
|
||
|
int n,m;
|
||
|
__int64 fac[18];
|
||
|
int ban[18][18];
|
||
|
__int64 dp[1<<17];
|
||
|
void ini()
|
||
|
{
|
||
|
int i;
|
||
|
fac[0]=1;
|
||
|
for(i=1;i<=17;i++) fac[i]=fac[i-1]*i;
|
||
|
}
|
||
|
void getban()
|
||
|
{
|
||
|
int a,b;
|
||
|
memset(ban,0,sizeof(ban));
|
||
|
while(m--)
|
||
|
{
|
||
|
scanf("%d%d",&a,&b);
|
||
|
a--;b--;
|
||
|
ban[a][b]=1;
|
||
|
}
|
||
|
}
|
||
|
void getdp()
|
||
|
{
|
||
|
int i,j,k;
|
||
|
memset(dp,0,sizeof(dp));
|
||
|
dp[0]=1;
|
||
|
for(i=0;i<n;i++)
|
||
|
for(j=(1<<n)-1;j>=0;j--)
|
||
|
{
|
||
|
if(!dp[j]) continue;
|
||
|
for(k=0;k<n;k++)
|
||
|
{
|
||
|
if(j&(1<<k)) continue;
|
||
|
if(ban[i][k]) continue;
|
||
|
dp[j|(1<<k)]+=dp[j];
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
int main()
|
||
|
{
|
||
|
int T,Case;
|
||
|
ini();
|
||
|
scanf("%d",&T);
|
||
|
for(Case=1;Case<=T;Case++)
|
||
|
{
|
||
|
scanf("%d%d",&n,&m);
|
||
|
getban();
|
||
|
getdp();
|
||
|
printf("Case %d: %I64d\n",Case,fac[n]-dp[(1<<n)-1]);
|
||
|
}
|
||
|
return 0;
|
||
|
}
|