题意
给你一个有向图的邻接矩阵,求以1为根的外向生成树数量。
n<=300
分析
用邻接矩阵-出度矩阵后求M1,1即是答案。
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N=305;
const int MOD=1000000007;
int n,a[N][N];
char str[N];
int gauss(int n)
{
int ans=1,f=1;
for (int i=1;i<=n;i++)
{
int l=0;
for (int j=i;j<=n;j++)
if (a[j][i]) {l=j;break;}
if (l!=i) for (int j=1;j<=n;j++) swap(a[i][j],a[l][j]);
for (int j=i+1;j<=n;j++)
if (a[j][i])
while (a[j][i])
{
if (a[j][i]<a[i][i])
{
for (int k=i;k<=n;k++) swap(a[i][k],a[j][k]);
f*=-1;
}
int w=a[j][i]/a[i][i];
for (int k=i;k<=n;k++) a[j][k]+=MOD-(LL)a[i][k]*w%MOD,a[j][k]-=a[j][k]>=MOD?MOD:0;
}
ans=(LL)ans*a[i][i]%MOD;
}
if (f==-1) ans=MOD-ans;
return ans;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%s",str+1);
for (int j=1;j<=n;j++)
if (str[j]=='1') (a[i][j]+=MOD-1)%=MOD,a[j][j]++;
}
for (int i=2;i<=n;i++)
for (int j=1;j<=n;j++)
a[i-1][j]=a[i][j];
for (int j=2;j<=n;j++)
for (int i=1;i<=n;i++)
a[i][j-1]=a[i][j];
printf("%d",gauss(n-1));
return 0;
}