Cosmic Tables

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 ≤ 106.

Next k lines contain queries in the format “si xi yi”, where si is one of the characters “с”, “r” or “g”, and xi, yi are two integers.

If si = “c”, then the current query is the query to swap columns with indexes xi and yi (1 ≤ x, y ≤ m, x ≠ y);
If si = “r”, then the current query is the query to swap rows with indexes xi and yi (1 ≤ x, y ≤ n, x ≠ y);
If si = “g”, then the current query is the query to obtain the number that located in the xi-th row and in the yi-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 (si = “g”) print the required number. Print the answers to the queries in the order of the queries in the input.

Examples
Input
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
8
9
6
Input
2 3 3
1 2 4
3 1 5
c 2 1
r 1 2
g 1 3
Output
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.
代码

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[1001][1001]={};
int x[10000],y[10000];
int main()
{
    int n,m,k;
    scanf("%d %d %d",&n,&m,&k);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
    {
        scanf("%d",&a[i][j]);
        x[i]=i;
        y[j]=j;
    }
    char s[3];
    int r,c;
    while(k--)
    {

        scanf("%s %d %d",&s,&r,&c);
        if(s[0]=='r')
        {
            swap(x[r],x[c]);
        }
        if(s[0]=='c')
        {
            swap(y[r],y[c]);
        }
        if(s[0]=='g')
        {
            printf("%d\n",a[x[r]][y[c]]);
        }
    }
}

这个题目没做上来，晚上同学告诉我的思路感觉思路很好就记了下来。
就是拿两个数组分别记录行和列的下标，交换两组时在这数组里交换，这样本来要处理的2n或2m个数据就变成了两个，这个优化思路很好，也不止适用于这一个题，用数组标记变化的题目在书上的求前缀和变化量的时候用到过，但当时的理解也仅限制在题目的思路上，现在看来另开一个数组处理变化的思想在代码优化上会起到不错的效果，以后做题可以用的到的地方还有很多。