KuribohG神犇说过,看到计数想容斥
把每个公司能负责的边都视作不同的,这样就变为生成树中每个集合里选一个的方案数
考虑容斥,每个集合选一个的等于任意选的方案数-sigma i一定没选的+sigma i,j一定没选的+……
2^n枚举那些是一定不选的,每次用matrix-tree算方案,容斥加起来
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 20
#define MAXM 1010
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
ll a[MAXN][MAXN];
int m[MAXN];
int n;
int v1[MAXN][MAXN*MAXN],v2[MAXN][MAXN*MAXN];
ll ans;
ll gs(){
int i,j,k;
ll re=1;
ll f=1;
for(i=1;i<n;i++){
for(j=1;j<n;j++){
(a[i][j]+=MOD)%=MOD;
}
}
for(i=1;i<n;i++){
for(j=i+1;j<n;j++){
ll A=a[i][i],B=a[j][i];
while(B){
ll C=A/B;
A%=B;
swap(A,B);
for(k=i;k<n;k++){
a[i][k]=(a[i][k]-C*a[j][k]%MOD+MOD)%MOD;
}
for(k=i;k<n;k++){
swap(a[i][k],a[j][k]);
}
f=-f;
}
}
if(!a[i][i]){
return 0;
}
(re*=a[i][i])%=MOD;
}
return (re*f+MOD)%MOD;
}
int main(){
int i,j,k;
scanf("%d",&n);
for(i=1;i<n;i++){
scanf("%d",&m[i]);
for(j=1;j<=m[i];j++){
scanf("%d%d",&v1[i][j],&v2[i][j]);
}
}
int N=1<<(n-1);
for(i=1;i<N;i++){
int t=0;
memset(a,0,sizeof(a));
for(j=1;j<n;j++){
if(i&(1<<(j-1))){
t++;
for(k=1;k<=m[j];k++){
a[v1[j][k]][v2[j][k]]--;
a[v2[j][k]][v1[j][k]]--;
a[v1[j][k]][v1[j][k]]++;
a[v2[j][k]][v2[j][k]]++;
}
}
}
(ans+=gs()*pow(-1,(n-1-t)&1)+MOD)%=MOD;
}
printf("%lld\n",ans);
return 0;
}
/*
*/