Matrix
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1021 Accepted Submission(s): 425
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) ;
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 .
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 1HintRecommand to use scanf and printf问题描述有一个n行m列的矩阵(1≤n≤1000,1≤m≤1000),在这个矩阵上进行q (1≤q≤100,000) 个操作: 1 x y: 交换矩阵M的第x行和第y行(1≤x,y≤n); 2 x y: 交换矩阵M的第x列和第y列(1≤x,y≤m); 3 x y: 对矩阵M的第x行的每一个数加上y(1≤x≤n,1≤y≤10,000); 4 x y: 对矩阵M的第x列的每一个数加上y(1≤x≤m,1≤y≤10,000);输入描述输入包含多组数据. 第一行有一个整数T(1≤T≤15), 表示测试数据的组数. 对于每组数据: 第一行输入3个整数n, m, q. 接下来的n行,每行包括m个整数,表示矩阵M。(1≤Mi,j≤10,000),(1≤i≤n,1≤j≤m). 最后q行,每行输入三个整数a(1≤a≤4), x, y。输出描述对于每组数据,输出经过所有q个操作以后的矩阵M。输入样例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输出样例12 13 14 15 1 2 3 4 3 4 5 6 1 10 10 1Hint建议使用scanf / printf 代替 cin / cout
//思路:模拟题,但是得用一点技巧
如果逐个改变的话,肯定会超时,所以用数组存一下即可。
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #define N 1010 using namespace std; int map[N][N]; int col[N],row[N]; int sumc[N],sumr[N]; int main() { int t,n,m,p; int i,j; scanf("%d",&t); while(t--) { scanf("%d%d%d",&n,&m,&p); for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { scanf("%d",&map[i][j]); } } for(i=1;i<=n;i++) col[i]=i; for(i=1;i<=m;i++) row[i]=i; memset(sumc,0,sizeof(sumc)); memset(sumr,0,sizeof(sumr)); int k,x,y; while(p--) { scanf("%d%d%d",&k,&x,&y); if(k==1) swap(col[x],col[y]),swap(sumc[x],sumc[y]); else if(k==2) swap(row[x],row[y]),swap(sumr[x],sumr[y]); else if(k==3) sumc[x]+=y; else sumr[x]+=y; } for(i=1;i<=n;i++) { for(j=1;j<m;j++) { printf("%d ",map[col[i]][row[j]]+sumc[i]+sumr[j]); } printf("%d\n",map[col[i]][row[m]]+sumc[i]+sumr[m]); } } return 0; }
Source