HDU 5671 Matrix

题目链接：

hdu:http://acm.hdu.edu.cn/showproblem.php?pid=5671

bc(中文):http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=692&pid=1001

题解：

由于都是整行整列操作的，所以可以吧行列分开讨论，最后再一一映射求出变化之后每个点的值。

代码：

#include<iostream>
#include<cstdio>
#include<cstring> 
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 1010;

int n, m, q;

LL mat[maxn][maxn];
int x[maxn], y[maxn];
LL addx[maxn], addy[maxn];
LL ans[maxn][maxn];

void init() {
    for (int i = 1; i <= n; i++) {
        x[i] = i;
    }
    for (int j = 1; j <= m; j++) {
        y[j] = j;
    }
    memset(addx, 0, sizeof(addx));
    memset(addy, 0, sizeof(addy));
}

int main() {
    int tc;
    scanf("%d", &tc);
    while (tc--) {
        scanf("%d%d%d", &n, &m, &q);
        init();
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                scanf("%lld", &mat[i][j]);
            }
        }
        while (q--) {
            int cmd, xx, yy;
            scanf("%d%d%d", &cmd, &xx, &yy);
            if (cmd == 1) {
                swap(x[xx], x[yy]);
                swap(addx[xx], addx[yy]);
            }
            else if (cmd == 2) {
                swap(y[xx], y[yy]);
                swap(addy[xx], addy[yy]);
            }
            else if (cmd == 3) {
                addx[xx] += yy;
            }
            else if (cmd == 4) {
                addy[xx] += yy;
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                ans[i][j] = mat[x[i]][y[j]] + addx[i] + addy[j];
            }
        }
        for (int i = 1; i <= n; i++) {
            printf("%lld", ans[i][1]);
            for (int j = 2; j <= m; j++) {
                printf(" %lld", ans[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}