Matrix
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1409 Accepted Submission(s): 561
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
Source
Recommend
这道题主要是学习了一个思想,就是直接对数组元素进行交换或操作是很 耗时间的,所以可以另开一个数组对原数组的下标进行关联,这样每次操作只需要一次就行了,这就是O(n)的复杂度就能轻松ac了。很巧妙。。。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#define LCA(s,x) memset(s,0,sizeof(s))
using namespace std;
const int N = 1005;
int map[N][N],a[N],b[N],c[N],d[N];
int main() {
int T;
scanf("%d",&T);
while(T--) {
int n,m,q;
LCA(b,0);
LCA(d,0);
for(int i=1; i<=N; i++) {
a[i]=i;
c[i]=i;
}
scanf("%d%d%d",&n,&m,&q);
for(int i=1; i<=n; i++) {
for(int j=1; j<=m; j++) {
scanf("%d",&map[i][j]);
}
}
while(q--) {
int k,x,y,temp;
scanf("%d%d%d",&k,&x,&y);
switch(k) {
case 1: {
temp=a[x];
a[x]=a[y];
a[y]=temp;
break;
}
case 2: {
temp=c[y];
c[y]=c[x];
c[x]=temp;
break;
}
case 3: {
b[a[x]]+=y;
break;
}
case 4: {
d[c[x]]+=y;
break;
}
}
}
for(int i=1; i<=n; i++) {
for(int j=1; j<=m; j++) {
if(j==1)
printf("%d",map[a[i]][c[j]]+b[a[i]]+d[c[j]]);
else
printf(" %d",map[a[i]][c[j]]+b[a[i]]+d[c[j]]);
}
printf("\n");
}
}
return 0;
}