BZOJ 3534([Sdoi2014]重建-变元矩阵-树定理-所有生成树的边权积和)

变元矩阵-树定理，求所有生成树边权积的和。把度数改为连出的边权和，$A[i][j]=-$边权，$A[i][i]=$连出的边权和.

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define eps (1e-8)
#define MAXN (305)
int n;
double a[MAXN][MAXN];
double det(int n) {
    bool f=0;
    For(i,n) {
        int k=0;
        Fork(j,i,n) if (fabs(a[j][i])>fabs(a[k][i])) {k=j;}
        For(j,n) swap(a[i][j],a[k][j]);
        if (i^k) f^=1;
        if (fabs(a[i][i])<eps) continue;
        Fork(j,i+1,n) {
            double t=a[j][i]/(a[i][i]); 
            Fork(k,i,n) {
                a[j][k]-=t*a[i][k];
            }
        }
    }
    double r=1;
    For(i,n) r=r*a[i][i];
    if (f) r=-r;
    return r;
}
int main()
{
//  freopen("bzoj3534.in","r",stdin);
//  freopen(".out","w",stdout);
    int n=read();
    MEM(a)
    double p=1;
    For(i,n) For(j,n) {
        double pp=0;
        scanf("%lf",&pp);
        if (i^j) a[i][j]=pp;
        if (i<j) p*=1-a[i][j];
        if (i^j) a[i][j]/=1-a[i][j];
        if (i^j) {
            a[i][i]+=a[i][j];
//          a[j][j]+=a[i][j];
            a[i][j]=-a[i][j];   
        }
    }

    printf("%.10lf\n",det(n-1)*p);


    return 0;
}