codeforces 222bCosmic Tables

题目

B. Cosmic Tables

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.

UCDHP stores some secret information about meteors as an n × m table with integers in its cells. The order of meteors in the Universe is changing. That's why the main UCDHP module receives the following queries:

• The query to swap two table rows;
• The query to swap two table columns;
• The query to obtain a secret number in a particular table cell.

As the main UCDHP module is critical, writing the functional of working with the table has been commissioned to you.

Input

The first line contains three space-separated integers n, m and k (1 ≤ n, m ≤ 1000, 1 ≤ k ≤ 500000) — the number of table columns and rows and the number of queries, correspondingly.

Next n lines contain m space-separated numbers each — the initial state of the table. Each number p in the table is an integer and satisfies the inequality 0 ≤ p ≤ 10⁶.

Next k lines contain queries in the format "s_i x_i y_i", where s_i is one of the characters "с", "r" or "g", and x_i, y_i are two integers.

• If s_i = "c", then the current query is the query to swap columns with indexes x_i and y_i (1 ≤ x, y ≤ m, x ≠ y);
• If s_i = "r", then the current query is the query to swap rows with indexes x_i and y_i (1 ≤ x, y ≤ n, x ≠ y);
• If s_i = "g", then the current query is the query to obtain the number that located in the x_i-th row and in the y_i-th column (1 ≤ x ≤ n, 1 ≤ y ≤ m).

The table rows are considered to be indexed from top to bottom from 1 to n, and the table columns — from left to right from 1 to m.

Output

For each query to obtain a number (s_i = "g") print the required number. Print the answers to the queries in the order of the queries in the input.

Examples

Input

Copy

3 3 5
1 2 3
4 5 6
7 8 9
g 3 2
r 3 2
c 2 3
g 2 2
g 3 2

Output

Copy

8
9
6

Input

Copy

2 3 3
1 2 4
3 1 5
c 2 1
r 1 2
g 1 3

Output

Copy

5

Note

Let's see how the table changes in the second test case.

After the first operation is fulfilled, the table looks like that:

2 1 4

1 3 5

After the second operation is fulfilled, the table looks like that:

1 3 5

2 1 4

So the answer to the third query (the number located in the first row and in the third column) will be 5.

首先有一个矩阵输入一个字母来代表对这个矩阵的操作c交换两列，r交换两行，g查询指定位置的数字。一开始是暴力解超时了，然后想到用数组来保存行和列的操作，做后直接用数组来代替下标可是实现方式有些错误，明明可以用swap我却用直接赋值漏掉了些情况。还有注意输入时需要用到scanf数据量比较大。

#include <iostream>
#include <cmath>
#include<algorithm>
#include<stack>
#include<string.h>
#include<cstdio>
#include<set>
using namespace std;
//int maxx,minn,j,k,a[100000];
//int n,x[100009],ans=0,a[100009],y[100009],l[100090],r[100090];
int n,m,a[1090][1090],l,b[2000],c[2000],x,y;
char o;
int main()
{
    //std::ios::sync_with_stdio(false);
    while(~scanf("%d%d%d",&n,&m,&l))
    {
        int p=max(n,m);
        for(int i=0;i<=p;i++)
        {
            b[i]=i;
            c[i]=i;
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        for(int i=0;i<l;i++)
        {
            scanf(" %s",&o);
            scanf("%d%d",&x,&y);
            if(o=='c')
            {
                swap(b[x],b[y]);
            }
            else if(o=='r')
            {
                swap(c[x],c[y]);
            }
            else if(o=='g')
                {
                  printf("%d\n",a[c[x]][b[y]]);
                }
        }
    }

}