题目链接:点击这里
题意:给出一个模3意义下的矩阵,每次选中一个元素就可以使得自身+2,上下左右元素+1。求所有元素变成0的一种解。
O((nm)3)
怎么会不炸!怎么会不炸!好吧就是不炸,可能在消元的时候0比较多吧=。= 可以为什么不用枚举自由元呢?不是很懂这个数据=。=
直接按照上下左右自身的元素对自己的贡献建立方程组暴力消元,遇到自由元直接取0(?),然后输出。注意是模3意义下的方程组,仿照一下开关问题就行了。
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
#define maxn 905
#define free Free
int a[maxn][maxn];
int mp[maxn][maxn];
int free[maxn*maxn]; //标记自由元
int x[maxn*maxn], cnt; //解集 自由元个数
int n, m;
void debug () {
cout << endl;
for (int i = 0; i < n*m; i++) {
for (int j = 0; j <= n*m; j++) {
cout << a[i][j] << " ";
} cout << endl;
}
cout << endl;
}
int Gauss () {
int max_r, col, k; //最大的数在的行 当前处理的列
cnt = 0; //自由元个数
for (k = 0, col = 0; k < n*m && col < n*m; k++, col++) {
max_r = k;
for (int i = k+1; i < n*m; i++) { //找到最大的数所在的行
if (abs (a[i][col]) > abs (a[max_r][col]))
max_r = i;
}
if (max_r != k) { //交换最大的数所在的行和当前行
for (int i = 0; i <= n*m; i++)
swap (a[k][i], a[max_r][i]);
}
if (a[k][col] == 0) { //判断自由元 处理当前行的下一列
k--;
free[cnt++] = col;
continue;
}
for (int i = k+1; i < n*m; i++) {
if (a[i][col]) {
int lcm = a[i][col] / __gcd(a[i][col], a[k][col]) * a[k][col];
int t1 = lcm / a[i][col];
int t2 = lcm / a[k][col];
for(int j = col; j <= n*m; j++) {
if (k == 0 && i == 1) {
}
a[i][j] = ((a[i][j] * t1 - a[k][j] * t2) % 3 + 3) % 3;
}
}
}
}
for (int i = k; i < n*n; i++) { //判断无解情况
if (a[i][col])
return -1;
}
for (int i = n*m-1; i >= 0; i--) { //回代
x[i] = a[i][n*m];
for (int j = i+1; j < n*m; j++)
x[i] = ((x[i]-x[j]*a[i][j]) % 3 + 3) % 3;
x[i] = x[i]*a[i][i] % 3;
}
return 0;
}
void solve () {
memset (x, 0, sizeof x);
memset (free, 0, sizeof free);
int tot = Gauss ();
int ans = 0;
for (int i = 0; i < n*m; i++)
ans += x[i];
printf ("%d\n", ans);
for (int i = 0; i < n*m; i++) {
for (int j = 0; j < x[i]; j++) {
printf ("%d %d\n", i/m+1, i%m+1);
}
}
return ;
}
#define move Move
const int move[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
bool legal (int x, int y) {
if (x < 0 || y < 0 || x >= n || y >= m)
return 0;
return 1;
}
int main () {
//freopen ("in", "r", stdin);
int t;
scanf ("%d", &t);
while (t--) {
scanf ("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf ("%d", &mp[i][j]);
}
}
memset (a, 0, sizeof a);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i*m+j][i*m+j] = 2;
for (int k = 0; k < 4; k++) {
int ii = i+move[k][0], jj = j+move[k][1];
if (legal (ii, jj))
a[i*m+j][ii*m+jj] = 1;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i*m+j][n*m] = (3-mp[i][j]) % 3;
}
}
//debug ();
solve ();
}
return 0;
}