2020icpc-济南站

A题

tag:思维 高斯消元 线性代数

题面

问题 A: Matrix Equation 时间限制：C/C++ 2秒，其他语言4秒 空间限制：C/C++ 262144K，其他语言524288K Special Judge, 64bit IO Format: %lld

题目描述
  We call a matrix “01 Square” if and only if it’s a N×N matrix and its elements are all 00 or 11.
  For two 01 Squares XX,YY, we define two operators X×Y and X⊙Y. The value of them are also 01 Square matrices and calculated below(we use Z to abbreviate X×Y and D to abbreviate X⊙Y):

$Z_{i,j}=(\sum _{k=1}^N{X}_{i,k}\times Y_{k,j}$) mod 2
$D_{i,j}=X_{i,j}{Y}_{i,j}$

  Now MianKing has two 01 Squares A,B, he wants to solve the matrix equation below:

$A\times C=B\odot C$

  You need to help MainKing solve this problem by calculating how many 01 Squares C satisfy this equation.
  The answer may be very large, so you only need to output the answer module 998244353998244353.
输入
  The first line has one integer N
  Then there are N lines and each line has N integers, the j-th integer of the i-th line denotes $A_{i,j}$
  Then there are N lines and each line has N integers, the j-th integer of the i-th line denotes $B_{i,j}$
  1≤N≤200, A i , j , B i , j ∈ { 0 , 1 } A_{i,j},B_{i,j} \in \{0,1\} Ai,j​,Bi,j​∈{0,1}
输出
  Output the answer module 998244353.

样例输入

4
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 1
1 0 1 1
0 1 1 1
1 0 0 1
1 1 1 0

样例输出

8

思路

  题意即对于给定01方阵A B找到01方阵C使得：$A\times C=B\odot C$，问C的种数。
  可以发现C的每列均是独立的，所以把每列的种数相乘即为C的种数。以样例为例进行说明：A=$\left[\begin{array}{cccc}0& 1& 0& 1\\ 0& 1& 1& 0\\ 0& 1& 1& 1\\ 1& 0& 0& 1\end{array}\right]$,B的第一列=$\left[\begin{array}{c}1\\ 0\\ 1\\ 1\end{array}\right]$,设C的第一列=$\left[\begin{array}{c}x1\\ x2\\ x3\\ x4\end{array}\right]$,可得：$\left[\begin{array}{c}x2+x4=x1\\ x2+x3=0\\ x2+x3+x4=x3\\ x1+x4=x4\end{array}\right]$,因为是mod 2加法所以相当于做异或：$\left[\begin{array}{c}x2⨁x4=x1\\ x2⨁x3=0\\ x2⨁x3⨁x4=x3\\ x1⨁x4=x4\end{array}\right]$,把等式右侧全部化0$\left[\begin{array}{c}x1⨁x2⨁x4=0\\ x2⨁x3=0\\ x2⨁x4=0\\ x1=0\end{array}\right]$,转化为矩阵表示：$\left[\begin{array}{cccc}x1& x2& x3& x4\\ 1& 1& 0& 1\\ 0& 1& 1& 0\\ 0& 1& 0& 1\\ 1& 0& 0& 0\end{array}\right]$,求矩阵的秩r，n-r即为此列中可自由取值的变量个数,每个变量可取0 or 1,所以此列的种数：$2^{n-r}$，所有列种数的乘积取模即为答案。
  采用高斯消元法求矩阵的秩，由于是异或操作，采用特殊的数据结构：biset进行存储以加速运算。（高斯消元法，即线性代数中学的通过简单行变换化阶梯矩阵，注意：在此过程中，当某列之下所有元素均为0时，行不变，列向右移动一位）。
附，上例运算过程：
$\left[\begin{array}{cccc}1\text{1}1& 1\text{1}1& 0\text{0}0& 1\text{1}1\\ 0& 1& 1& 0\\ 0& 1& 0& 1\\ 1\text{1}1& 0& 0& 0\end{array}\right]$,第四行与第一行做异或$\to$$\left[\begin{array}{cccc}1& 1& 0& 1\\ 0\text{0}0& 1\text{1}1& 1\text{1}1& 0\text{0}0\\ 0& 1\text{1}1& 0& 1\\ 0& 1\text{1}1& 0& 1\end{array}\right]$,第三、四行与第二行做异或$\to$ $\left[\begin{array}{cccc}1& 1& 0& 1\\ 0& 1& 1& 0\\ 0\text{0}0& 0\text{0}0& 1\text{1}1& 1\text{1}1\\ 0& 0& 1\text{1}1& 1\end{array}\right]$,第四行与第三行做异或$\to$ $\left[\begin{array}{cccc}1& 1& 0& 1\\ 0& 1& 1& 0\\ 0& 0& 1& 1\\ 0\text{0}0& 0\text{0}0& 0\text{0}0& 0\text{0}0\end{array}\right]$.所以该矩阵秩为3，自由取值变量个数为1，种数为2.

源码

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=998244353;
ll qpow(ll a,ll p){
	ll ans=1;
	while(p){
		if(p&1) ans=ans*a%mod;
		a=a*a%mod;
		p>>=1;
	}
	return ans;
}
int A[205][205],B[205][205];
bitset<205> a[205];
ll guass(int n){
	for(int i=1,p=1;i<=n;i++){
		if(!a[p][i]){
			for(int j=p+1;j<=n;j++){
				if(a[j][i]) {swap(a[p],a[j]);break;}
			}
		}
		if(!a[p][i]) continue;//当目前列全部为0时，列右移，行不动；p为行，i为列。 
		for(int j=p+1;j<=n;j++){
			if(a[j][i]) a[j]^=a[p];
		}
		p++;
	}
	int ans=0;
	for(int j=n;j>=1;j--){
		if(a[j].none()) ans++;
		else break; 
	}
	return ans;
}
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&A[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&B[i][j]);
		}
	}	
	ll ans=0;
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				a[i][j]=A[i][j];
			}
			if(B[i][k]) a[i][i]=a[i][i]^1;
		}
		ans+=guass(n);
		//printf("guass:%d\n",guass(n));
//		for(int i=1;i<=n;i++){
//			for(int j=1;j<=n;j++){
//				cout<<a[i][j];
//			}printf("\n");
//		}printf("\n");
	}
	printf("%lld\n",qpow(2,ans));
	return 0;
}