Codeforces Round 137 (Div. 2)
B
Cosmic Tables
Codeforces
1300
原题
← AC →
翻译中…

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^{6}$.

翻译中…

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.

翻译中…

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.

翻译中…

样例

Input #1
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 #1
8
9
6
InputCopy OutputCopy
Input #2
2 3 3
1 2 4
3 1 5
c 2 1
r 1 2
g 1 3
Output #2
5
InputCopy OutputCopy
题目信息
题号
222B
时间限制
3 s
内存限制
256 MB
标签
数据结构
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。