【HDU 杭电 5671 Matrix】

Matrix

Problem Description
There is a matrix M that has n rows and m columns (1≤n≤1000,1≤m≤1000).Then we perform q(1≤q≤100,000) operations:

1 x y: Swap row x and row y (1≤x,y≤n);

2 x y: Swap column x and column y (1≤x,y≤m);

3 x y: Add y to all elements in row x (1≤x≤n,1≤y≤10,000);

4 x y: Add y to all elements in column x (1≤x≤m,1≤y≤10,000);

Input
There are multiple test cases. The first line of input contains an integer T(1≤T≤20) indicating the number of test cases. For each test case:

The first line contains three integers n, m and q.
The following n lines describe the matrix M.(1≤Mi,j≤10,000) for all (1≤i≤n,1≤j≤m).
The following q lines contains three integers a(1≤a≤4), x and y.

Output
For each test case, output the matrix M after all q operations.

Sample Input
2
3 4 2
1 2 3 4
2 3 4 5
3 4 5 6
1 1 2
3 1 10
2 2 2
1 10
10 1
1 1 2
2 1 2

Sample Output
12 13 14 15
1 2 3 4
3 4 5 6
1 10
10 1

#include<cstdio>
#include<algorithm>
using namespace std;
int pa[1011][1011];
int ma[1011];//储存行数
int mb[1011];//储存列数
int na[1011];//见证在该行所加数的大小
int nb[1011];//见证在该列所加数的大小
int main()
{
    int T;
    int i,j;
    int N,M,Q;
    int a,x,y;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&N,&M,&Q);
        for(i=1;i<=N;i++)
        {
           ma[i]=i;//初始化行数
           na[i]=0;//初始化在该行所加的数
        }
        for(i=1;i<=M;i++)
        {
            mb[i]=i;//初始化列数
            nb[i]=0;
        }
        for(i=1;i<=N;i++)
            for(j=1;j<=M;j++)
        {
            scanf("%d",&pa[i][j]);
        }
        for(i=1;i<=Q;i++)
        {
            scanf("%d%d%d",&a,&x,&y);
            if(a==1)
                {
                    swap(ma[x],ma[y]);
                }
            else if(a==2)
                {
                    swap(mb[x],mb[y]);
                }
            else if(a==3)
                {
                   na[ma[x]]+=y;
                }
            else
                {
                    nb[mb[x]]+=y;
                }
        }
        for(i=1;i<=N;i++)
        {
            for(j=1;j<M;j++)
            printf("%d ",pa[ma[i]][mb[j]]+na[ma[i]]+nb[mb[j]]);
            printf("%d\n",pa[ma[i]][mb[j]]+na[ma[i]]+nb[mb[j]]);
        }
    }
    return 0;
}