很久以前看过
Purfer
但忘完了…补一补…
m
只有
具体来说,若有
cnt
个点的度数有约束,分别为
v1,v2....vcnt
。总方案为:
(n−2−∑(vi−1))n−cnt∗∏i=1cnt(∑cntk=1(vk−1)vi−1)=(n−2−∑(vi−1))n−cnt∗(n−2)!∏(vi−1)!(n−2−∑(vi−1))!
#include<cstdio>
#include<cstring>
#include<algorithm>
#define Fir first
#define Sec second
#define mp(x,y) make_pair(x,y)
using namespace std;
typedef long long LL;
const int maxn=1000005,MOD=1000000007;
LL ans,fac[maxn],inv[maxn],fac_inv[maxn];
bool vis[20];
inline LL C(int n,int m){ return (n<m||n<0||m<0)?0:fac[n]*fac_inv[m]%MOD*fac_inv[n-m]%MOD; }
int n,m,a[maxn];
pair<int,int> q[20];
inline LL Pow(LL a,int b){
LL res=1;
for(;b;b>>=1,a=a*a%MOD) if(b&1) res=(res*a)%MOD;
return res;
}
int main(){
freopen("51nod1806.in","r",stdin);
freopen("51nod1806.out","w",stdout);
fac[0]=1; for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%MOD;
inv[1]=1; for(int i=2;i<=1000000;i++)
inv[i]=(LL)(MOD-MOD/i)*inv[MOD%i]%MOD;
fac_inv[0]=1; for(int i=1;i<=1000000;i++) fac_inv[i]=fac_inv[i-1]*inv[i]%MOD;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++) scanf("%d%d",&q[i].Fir,&q[i].Sec);
if(n==1){
if(m==1) return printf("0"),0;
return printf("1"),0;
}
for(int s=0;s<=(1<<m)-1;s++){
LL _sum=0,_prod=1,cnt=0; bool pd=true;
memset(vis,0,sizeof(vis));
for(int i=1;i<=m&pd;i++) if((s>>i-1)&1){
if(vis[q[i].Fir]) pd=false; vis[q[i].Fir]=true;
_sum+=q[i].Sec-1; (_prod*=fac_inv[q[i].Sec-1])%=MOD; cnt++;
}
if(!pd) continue;
if(n-2-_sum<0||n-cnt<0) continue;
(ans+=(LL)((cnt&1)?-1:1)*fac[n-2]*fac_inv[n-2-_sum]%MOD*_prod%MOD*Pow(n-cnt,n-2-_sum)%MOD)%=MOD;
//printf("%lld\n",(ans+MOD)%MOD);
}
printf("%d\n",(ans+MOD)%MOD);
return 0;
}