HDU 5671 Matrix

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=5671

思路：另开数组记录操作

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int maxn = 1010;
int map1[maxn][maxn];
int r[maxn],c[maxn];
int ra[maxn],ca[maxn];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,q;
        memset(map1,0,sizeof(map1));
        scanf("%d%d%d",&n,&m,&q);
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                scanf("%d",&map1[i][j]);
            }
        }
        for(int i=1; i<=n; i++)
            r[i] = i;
        for(int i=1; i<=m; i++)
            c[i] = i;
        memset(ra,0,sizeof(ra));
        memset(ca,0,sizeof(ca));
        while(q--)
        {
            int a,x,y;
            scanf("%d%d%d",&a,&x,&y);
            if(a == 1)
                swap(r[x],r[y]);
            else if(a == 2)
                swap(c[x],c[y]);
            else if(a == 3)
                ra[r[x]]+=y;
            else if(a == 4)
                ca[c[x]]+=y;
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                map1[i][j] += ra[i];
            }
        }
        for(int i=1; i<=m; i++)
        {
            for(int j=1; j<=n; j++)
            {
                map1[j][i] += ca[i];
            }
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                if(j == 1)
                    printf("%d",map1[r[i]][c[j]]);
                else
                    printf(" %d",map1[r[i]][c[j]]);
            }
            printf("\n");
        }
    }
    return 0;
}