ACS - A concrete simulation

no tags 

You are given a matrix M of type 1234x5678. It is initially filled with integers 1...1234x5678 in row major order. Your task is to process a list of commands manipulating M. There are 4 types of commands:
"R x y" swap the x-th and y-th row of M ;
"C x y" swap the x-th and y-th column of M ;
"Q x y" write out M(x,y) ;
"W z" write out x and y where z=M(x,y).

Input

A list of valid commands. Input terminated by EOF.

Output

For each "Q x y" write out one line with the current value of M(x,y), for each "W z" write out one line with the value of x and y ( interpreted as above ) separated by a space.

Input:
R 1 2
Q 1 1
Q 2 1
W 1
W 5679
C 1 2
Q 1 1
Q 2 1
W 1
W 5679

Output:
5679
1
2 1
1 1
5680
2
2 2
1 2

hide comments
aexpo: 2017-07-05 09:11:20

R,C,Q,W all in O(1)

deerishi: 2016-07-01 20:20:44

Good Adhoc Problem!!

karthik1997: 2016-06-09 16:11:09

Good Adhoc problem ..
@Divyank Duvedi : It is r*5678 +c
And a big thanks to Anurag for the corner case .. Ac in 0.00 s
Hint : Can use ordered_map if using STL and it is blazing fast ............. instead of contiguous array and for every Query can be solved in O(1) with some extra memory .... :p

Last edit: 2016-06-09 16:13:34
gullu_mishra: 2016-03-06 13:11:53

amazing problm .....queries in O(1)

minhthai: 2016-01-18 10:43:11

nice problem :) big thank to the author

Diksha Jaiswal: 2015-12-28 08:11:46

AC in 0.0sec with all queries in O(1)

SangKuan: 2015-08-16 10:35:44

all in O(1)

(Tjandra Satria Gunawan)(曾毅昆): 2015-08-02 13:28:21

Very good Ad hoc problem :)

chin: 2015-07-03 21:10:53

Easy One!!!

robin_0: 2015-06-21 20:30:48

Getting WA :(
Any corner cases ? :/


Added by:Noszi
Date:2005-06-10
Time limit:7s
Source limit:7777B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:Folklore