Assume you are given a square matrix of dimension N. Let this matrix be called A.
Your task is to rotate A in clockwise direction by S degrees, where S is angle of rotation.
On the matrix, there will be 3 types of operations viz.
Rotation
Rotate the matrix A by angle S, presented as input in form of A S
Querying
Query the element at row K and column L, presented as input in form of Q K L
Updation
Update the element at row X and column Y with value Z, presented as input in form of U X Y Z
Print the output of individual operations as depicted in Output Specification
Input Format
Input will consist of three parts, viz.
1. Size of the matrix (N)
2. The matrix itself (A = N * N)
3. Various operations on the matrix, one operation on each line. (Beginning either with A, Q or U)
-1 will represent end of input.
Note:
Angle of rotation will always be multiples of 90 degrees only.
All Update operations happen only on the initial matrix. After update all the previous rotations have to be applied on the updated matrix
Constraints
1<=N<=1000
1<=Aij<=1000
0<=S<=160000
1<=K, L<=N
1<=Q<=100000
Output Format
For each Query operation print the element present at K-L location of the matrix in its current state.
Sample Input 0
2
1 2
3 4
A 90
Q 1 1
Q 1 2
A 90
Q 1 1
U 1 1 6
Q 2 2
-1
Sample Output 0
3
1
4
6
Explanation 0
Initial Matrix
1 2
3 4
After 90 degree rotation, the matrix will become
3 1
4 2
Now the element at A11 is 3 and A12 is 1.
Again the angle of rotation is 90 degree, now after the rotation the matrix will become
4 3
2 1
Now the element at A11 is 4.
As the next operation is Update, update initial matrix i.e.
6 2
3 4
After updating, apply all the previous rotations (i.e. 180 = two 90 degree rotations).
The matrix will now become
4 3
2 6
Now A22 is 6.
Solution :
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n;
scanf("%d",&n);
int a[n][n],i,j,s=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
while(1)
{
char c;
scanf(" %c",&c);
if(c == '-')
return 0;
else if(c=='A')
{
int x;
scanf("%d",&x);
s=s+x/90;
s=s%4;
}
else if(c == 'Q')
{
int x,y;
scanf("%d%d",&x,&y);
x--;
y--;
if(s == 0) printf("%d\n",a[x][y]);
if(s== 1) printf("%d\n",a[n-y-1][x]);
if(s== 2) printf("%d\n",a[n-x-1][n-y-1]);
if(s== 3) printf("%d\n",a[y][n-x-1]);
}
else if(c == 'U')
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
a[x-1][y-1]=z;
}
}
return 0;
}
