洛谷P4111[HEOI2015]小z的房间

矩阵树定理的第一题
用高斯消元法算行列式

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 83, md = 1e9;
int n, m, L[maxn][maxn], a[10][10], A[maxn][maxn];
int D[maxn][maxn], tot, id[maxn][maxn];
char str[maxn];
int nx[4] = {-1, 0, 1, 0}, ny[4] = {0, -1, 0, 1};
ll det() {
    ll res = 1;
    for (int i = 1; i < tot; i++) {
        for (int j = i + 1; j < tot; j++) {
            while (L[j][i]) {
                ll tmp = L[i][i] / L[j][i];
                for (int k = i; k < tot; k++) 
                    L[i][k] = (L[i][k] - tmp * L[j][k] + md) % md;
                swap(L[i], L[j]);
                res = -res;
            }
        }
        res = res * L[i][i] % md;
    }
    return (res + md) % md;
}
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        scanf("%s", str+1);
        for (int j = 1; j <= m; j++) {
            a[i][j] = str[j] == '*' ? 0 : 1;
            if (a[i][j]) id[i][j] = ++tot;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (id[i][j]) {
                for (int k = 0; k < 4; k++) {
                    int tx = nx[k] + i, ty = ny[k] + j;
                    if (tx < 1 || tx > n || ty < 1 || ty > m) 
                        continue;
                    if (id[tx][ty]) {
                        A[id[i][j]][id[tx][ty]]++;
                        //A[id[tx][ty]][id[i][j]] = 1;
                        D[id[i][j]][id[i][j]]++;
                        //D[id[tx][ty]][id[tx][ty]]++;
                    }
                }
            }
        }
    }
    for (int i = 1; i <= tot; i++) {
        for (int j = 1; j <= tot; j++) {
            L[i][j] = D[i][j] - A[i][j];
        }
    }
    cout << det() << endl;
}