2 seconds
256 megabytes
standard input
standard output
Little Artem likes electronics. He can spend lots of time making different schemas and looking for novelties in the nearest electronics store. The new control element was delivered to the store recently and Artem immediately bought it.
That element can store information about the matrix of integers size n × m. There are n + m inputs in that element, i.e. each row and each column can get the signal. When signal comes to the input corresponding to some row, this row cyclically shifts to the left, that is the first element of the row becomes last element, second element becomes first and so on. When signal comes to the input corresponding to some column, that column shifts cyclically to the top, that is first element of the column becomes last element, second element becomes first and so on. Rows are numbered with integers from 1 to n from top to bottom, while columns are numbered with integers from 1 to m from left to right.
Artem wants to carefully study this element before using it. For that purpose he is going to set up an experiment consisting of q turns. On each turn he either sends the signal to some input or checks what number is stored at some position of the matrix.
Artem has completed his experiment and has written down the results, but he has lost the chip! Help Artem find any initial matrix that will match the experiment results. It is guaranteed that experiment data is consistent, which means at least one valid matrix exists.
The first line of the input contains three integers n, m and q (1 ≤ n, m ≤ 100, 1 ≤ q ≤ 10 000) — dimensions of the matrix and the number of turns in the experiment, respectively.
Next q lines contain turns descriptions, one per line. Each description starts with an integer ti (1 ≤ ti ≤ 3) that defines the type of the operation. For the operation of first and second type integer ri (1 ≤ ri ≤ n) or ci (1 ≤ ci ≤ m) follows, while for the operations of the third type three integers ri, ci and xi (1 ≤ ri ≤ n, 1 ≤ ci ≤ m, - 109 ≤ xi ≤ 109) are given.
Operation of the first type (ti = 1) means that signal comes to the input corresponding to row ri, that is it will shift cyclically. Operation of the second type (ti = 2) means that column ci will shift cyclically. Finally, operation of the third type means that at this moment of time cell located in the row ri and column ci stores value xi.
Print the description of any valid initial matrix as n lines containing m integers each. All output integers should not exceed 109 by their absolute value.
If there are multiple valid solutions, output any of them.
2 2 6
2 1
2 2
3 1 1 1
3 2 2 2
3 1 2 8
3 2 1 8
8 2
1 8
3 3 2
1 2
3 2 2 5
0 0 0
0 0 5
0 0 0 题意：恶心模拟 3种对矩阵的操作
1 r 第r行的第一个元素放到最后一个
2 c 第c列的第一个元素放到最后一个
3 r c x 第r行c列的赋值为x
给你q个操作 输出初始矩阵 题解：恶心倒序模拟
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#define ll __int64
#define pi acos(-1.0)
#define mod 1
#define maxn 10000
using namespace std;
int n,m,q;
struct node
{
int type;
int r,l,value;
}N[];
int mp[][];
int exm;
int main()
{
scanf("%d %d %d",&n,&m,&q);
memset(mp,,sizeof(mp));
memset(N,,sizeof(N));
for(int i=;i<=q;i++)
{
scanf("%d",&exm);
N[i].type=exm;
if(exm==)
scanf("%d",&N[i].r);
if(exm==)
scanf("%d",&N[i].l);
if(exm==)
scanf("%d %d %d",&N[i].r,&N[i].l,&N[i].value);
}
for(int i=q;i>=;i--)
{
if(N[i].type==)
{
int gg=mp[N[i].r][m];
for(int j=m-;j>=;j--)
mp[N[i].r][j+]=mp[N[i].r][j];
mp[N[i].r][]=gg;
}
if(N[i].type==)
{
int gg=mp[n][N[i].l];
for(int j=n-;j>=;j--)
mp[j+][N[i].l]=mp[j][N[i].l];
mp[][N[i].l]=gg;
}
if(N[i].type==)
{
mp[N[i].r][N[i].l]=N[i].value;
}
}
for(int i=;i<=n;i++)
{
cout<<mp[i][];
for(int j=;j<=m;j++)
cout<<" "<<mp[i][j];
cout<<endl;
}
return ;
}