Martix-Tree定理求解图的生成树个数
构造度数矩阵和邻接矩阵(有向图的度数矩阵就是一个点的入度,无向图就是它相邻的点都算上)
(如果(u,v)有一条边,邻接矩阵就加一。)
基尔霍夫矩阵=度数矩阵-邻接矩阵
无向图:基尔霍夫矩阵去掉任意一行一列后的行列式。
有向图:基尔霍夫矩阵去掉根所在行列后的行列式。
luoguP4455
#include <bits/stdc++.h>
using namespace std;
const int N = 255, P = 10007;
int a[N][N], n, m;
inline int q_p(int a, int b, int P) {
int res = 1;
while (b) {
if (b & 1) res = 1LL * res * a % P;
a = 1LL * a * a % P;
b >>= 1;
}
return res;
}
inline int gauss() {
int f = 1, ans = 1;
for (int i = 2; i <= n; ++i) { // delete the first line & row
int p = i;
for (; p <= n; ++p) if (a[p][i]) break; // may be have '-'
if (p != i) {
for (int j = 2; j <= n; ++j) swap(a[p][j], a[i][j]);
f *= -1;
}
if (!a[i][i]) return 0;
ans = ans * a[i][i] % P;
int inv = q_p(a[i][i], P - 2, P);
for (int j = i + 1; j <= n; ++j) {
if (!a[j][i]) continue;
int mul = inv * a[j][i] % P;
for (int k = 2; k <= n; ++k) {
a[j][k] = (a[j][k] - mul * a[i][k]) % P;
}
}
}
ans *= f;
return (ans % P + P) % P;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; ++i) {
int x, y; scanf("%d %d", &x, &y);// y->x
a[x][x]++; a[y][x]--;
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
a[i][j] = ((a[i][j] % P) + P) % P;
}
}
printf("%d\n", gauss());
return 0;
}
f
f
f的作用:交换矩阵的两行(列),行列式的值变成原来的相反数。 所以记录了交换多少次。
消元的过程:
因为
a
[
i
]
[
i
]
p
−
1
=
1
(
m
o
d
p
)
a[i][i]^{p-1}=1(mod\ p)
a[i][i]p−1=1(mod p),所以
1
−
a
[
i
]
[
i
]
p
−
1
=
0
(
m
o
d
p
)
1-a[i][i]^{p-1}=0(mod\ p)
1−a[i][i]p−1=0(mod p),所以
a
[
j
]
[
i
]
a[j][i]
a[j][i]都乘以
1
−
a
[
i
]
[
i
]
p
−
1
1-a[i][i]^{p-1}
1−a[i][i]p−1就好了。考虑把他转换成矩阵的加减,就是
a
[
j
]
[
i
]
−
=
a
[
j
]
[
i
]
∗
a
[
i
]
[
i
]
p
−
1
a[j][i]-=a[j][i]*a[i][i]^{p-1}
a[j][i]−=a[j][i]∗a[i][i]p−1。因为矩阵如果某行(列)加上另一行(列)的
k
k
k倍,行列式的值 不变。所以可以这样做。
这种消元只能做P是素数的情况。
luoguP4111
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 12, P = 1e9;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
char s[N][N];
int id[N][N], vis[N*N][N*N], cnt;
LL a[N*N][N*N];
int n, m;
inline char readc() {
char ch = getchar();
while (ch != '.' && ch != '*') ch = getchar();
return ch;
}
inline int legal(int x, int y) {return (x >= 1) && (x <= n) && (y >= 1) && (y <= m);}
inline int gauss() {
int f = 1, ans = 1;
for (int i = 2; i <= cnt; ++i) {
int p = i;
for (; p <= cnt; ++p) if(a[p][i]) break;
if (p != i) {
swap(a[i], a[p]);
f *= -1;
}
if (!a[i][i]) return 0;
int j = i + 1;
while (j <= cnt) {
while (1) {
if (!a[j][i]) {j++; break;}
int bas = a[j][i] / a[i][i];
for (int k = 2; k <= cnt; ++k)
a[j][k] = ((a[j][k] - 1LL * bas * a[i][k]) % P + P) % P;
if (!a[j][i]) {j++; break;}
swap(a[i], a[j]);
f *= -1;
}
}
ans = 1LL * ans * a[i][i] % P;
}
ans *= f;
return (ans % P + P) % P;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
s[i][j] = readc();
if (s[i][j] == '.') id[i][j] = ++cnt;
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (s[i][j] == '.') {
for (int k = 0; k < 4; ++k) {
int nxtx = i + dx[k], nxty = j + dy[k];
if (legal(nxtx, nxty) && s[nxtx][nxty] == '.') {
a[id[i][j]][id[i][j]]++;
a[id[i][j]][id[nxtx][nxty]]--;
}
}
}
}
}
for (int i = 1; i <= cnt; ++i) {
for (int j = 1; j <= cnt; ++j) {
a[i][j] = (a[i][j] % P + P) % P;
}
}
printf("%d\n", gauss());
return 0;
}
因为消元会交换 i i i行和 j j j行,所以要在消元之后再统计答案。