矩阵的行列式、秩和逆

知识点 - 矩阵的行列式、秩和逆

解决问题类型：

求矩阵的行列式和秩

模板和复杂度：

求行列式

和n*n的高斯消元一样，除了a[i][j] /= a[i][i];

const double EPS = 1E-9;
int n;
vector < vector<double> > a (n, vector<double> (n));

double det = 1;
for (int i=0; i<n; ++i) {
	int k = i;
	for (int j=i+1; j<n; ++j)
		if (abs (a[j][i]) > abs (a[k][i]))
			k = j;
	if (abs (a[k][i]) < EPS) {
		det = 0;
		break;
	}
	swap (a[i], a[k]);
	if (i != k)
		det = -det;
	det *= a[i][i];
	for (int j=i+1; j<n; ++j)
		a[i][j] /= a[i][i];
	for (int j=0; j<n; ++j)
		if (j != i && abs (a[j][i]) > EPS)
			for (int k=i+1; k<n; ++k)
				a[j][k] -= a[i][k] * a[j][i];
}

cout << det;

求秩

秩不会超过min(n,m), 每次遇到一列全0的 ，rank–

const double EPS = 1E-9;

int compute_rank(vector<vector<int>> A) {
    int n = A.size();
    int m = A[0].size();

    int rank = max(n, m);
    vector<bool> row_selected(n, false);
    for (int i = 0; i < m; ++i) {
        int j;
        for (j = 0; j < n; ++j) {
            if (!row_selected[j] && abs(A[j][i]) > EPS)
                break;
        }

        if (j == n) {
            --rank;
        } else {
            row_selected[j] = true;
            for (int p = i + 1; p < m; ++p)
                A[j][p] /= A[j][i];
            for (int k = 0; k < n; ++k) {
                if (k != j && abs(A[k][i]) > EPS) {
                    for (int p = i + 1; p < m; ++p)
                        A[k][p] -= A[j][p] * A[k][i];
                }
            }
        }
    }
    return rank;
}

例题

Codeforces div1 - Wizards and Bets

代码

//https://www.cnblogs.com/N-Psong/p/10281725.html
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

vector<int> g[1005];
LL n,m,p;
LL in[1005],out[1005],pos1[1005],pos2[1005],cnt1,cnt2;
LL matrix[1005][1005],num[1005][1005];
LL vis[1005];
LL sink[1005],sink_num,source[1005],source_num;

void dfs(LL u){
    vis[u]=1;
    if(out[u]==0){
        num[u][u]=1;
    }
    for(LL i=0;i<g[u].size();i++){
        LL v=g[u][i];
        if(!vis[v]) dfs(v);
        for(LL j=0;j<sink_num;j++){
            num[u][sink[j]]=(num[v][sink[j]]+num[u][sink[j]])%p;
        }
    }
}

void solve(LL n){
    LL ans=1,flag=0;
    for(LL i=0;i<n;i++){
        for(LL j=i+1;j<n;j++){
            LL x=i,y=j;
            while(matrix[y][i]){
                LL t=matrix[x][i]/matrix[y][i];
                for(LL k=i;k<n;k++) matrix[x][k]=(matrix[x][k]-matrix[y][k]*t)%p;
                swap(x,y);
            }
            if(x!=i){
                for(LL k=0;k<n;k++) swap(matrix[i][k],matrix[x][k]);
                flag^=1;
            }
        }
        if(matrix[i][i]==0){
            printf("%d\n",0);
            return ;
        }
        else ans=ans*matrix[i][i]%p;
    }

    if(flag!=0) ans*=-1;
    if(ans<0) ans+=p;
    printf("%lld\n",ans);
}

int main(){
    scanf("%lld%lld%lld",&n,&m,&p);
    for(LL i=1;i<=m;i++){
        LL u,v;
        scanf("%lld%lld",&u,&v);
        out[u-1]++;
        in[v-1]++;
        g[u-1].push_back(v-1);
    }
    for(LL i=0;i<n;i++){
        if(in[i]==0){
            pos1[i]=cnt1++;
            source[source_num++]=i;
        }
        if(out[i]==0){
            pos2[i]=cnt2++;
            sink[sink_num++]=i;
        }
    }
    for(LL i=0;i<n;i++) if(in[i]==0) dfs(i);
    for(LL i=0;i<cnt1;i++){
        for(LL j=0;j<cnt2;j++){
            matrix[i][j]=num[source[i]][sink[j]];
        }
    }
    solve(cnt1);


    return 0;
}