SPOJ104:Highways（矩阵树定理）

关于矩阵树定理的证明：https://wenku.baidu.com/view/872eb02de2bd960590c677c6.html

(对了 高斯消元记得判无解)

#include<bits/stdc++.h>
using namespace std;
const double eps=1e-5;
namespace IO
{
    streambuf *ib,*ob;int buf[50];
    inline void init()
    {
        ios::sync_with_stdio(false);
        cin.tie(NULL);cout.tie(NULL);
        ib=cin.rdbuf();ob=cout.rdbuf();
    }
    inline int read()
    {
        char ch=ib->sbumpc();int i=0,f=1;
        while(!isdigit(ch)){if(ch=='-')f=-1;ch=ib->sbumpc();}
        while(isdigit(ch)){i=(i<<1)+(i<<3)+ch-'0';ch=ib->sbumpc();}
        return i*f;
    }
    inline void W(long long x)
    {
        if(!x){ob->sputc('0');return;}
        if(x<0){ob->sputc('-');x=-x;}
        while(x){buf[++buf[0]]=x%10;x/=10;}
        while(buf[0])ob->sputc(buf[buf[0]--]+'0');
    }
}
using namespace IO;
const int Maxn=15;
int n,m,C[Maxn][Maxn],A[Maxn][Maxn];
double H[Maxn][Maxn],*matrix[Maxn];
inline double gauss()
{
    for(int i=1;i<=n;i++)
    {
        int l=i;
        for(int j=i+1;j<=n;j++)if(fabs(matrix[j][i])>fabs(matrix[l][i]))l=j;
        if(l!=i)swap(matrix[l],matrix[i]);
        if(fabs(matrix[i][i])<eps)return 0;
        for(int j=i+1;j<=n;j++)
        {
            double t=matrix[j][i]/matrix[i][i];
            for(int k=i;k<=n;k++)
            matrix[j][k]-=matrix[i][k]*t;
        }
    }
    double ans=1;
    for(int i=1;i<=n;i++)ans*=matrix[i][i];
    return ans;
}
int main()
{
    init();
    int T=read();
    while(T--)
    {
        memset(C,0,sizeof(C));
        memset(A,0,sizeof(A));
        memset(H,0,sizeof(H));
        n=read(),m=read();
        for(int i=1;i<=n;i++)matrix[i]=H[i];
        for(int i=1;i<=m;i++)
        {
            int x=read(),y=read();
            if(!A[x][y])
            {
                C[x][x]++;C[y][y]++;
                A[x][y]++,A[y][x]++;
            }   
        }
        if(n==1){ob->sputc('1');ob->sputc('\n');continue;}
        n--;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            H[i][j]=C[i][j]-A[i][j];
        W((long long)(gauss()+0.5));ob->sputc('\n');
    }
}