UVA 512 Spreadsheet Tracking

题目链接：https://vjudge.net/problem/UVA-512

题目翻译摘自《算法禁赛入门经典》

题目大意

　　有一个 r 行 c 列（1 ≤ r，c ≤ 50）的电子表格，行从上到下编号为 1～r，列从左到右编号为 1～c。

　　现在有五种操作，（删除/插入）某些（行/列）及交换两个单元格位置。

　　现在对表格进行 n 次操作，接下来是 q 个查询，每个查询格式 为“r c”，表示查询原始表格的单元格 (r,c)。对于每个查询，输出操作执行完后该单元格的新位置。输入保证在任意时刻行列数均不超过 50。

分析

　　模拟，体力活，考察基本功。

代码如下

#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,inf,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "\n";
    return out;
}

inline int gc(){
    static const int BUF = 1e7;
    static char buf[BUF], *bg = buf + BUF, *ed = bg;
    
    if(bg == ed) fread(bg = buf, 1, BUF, stdin);
    return *bg++;
} 

inline int ri(){
    int x = 0, f = 1, c = gc();
    for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
    for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
    return x*f;
}

template<class T>
inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< int, PII > PIPII;
typedef pair< string, int > PSI;
typedef pair< int, PSI > PIPSI;
typedef set< int > SI;
typedef set< PII > SPII;
typedef vector< int > VI;
typedef vector< VI > VVI;
typedef vector< PII > VPII;
typedef map< int, int > MII;
typedef map< int, PII > MIPII;
typedef map< PII, int > MPIII;
typedef map< string, int > MSI;
typedef map< string, string > MSS;
typedef map< PII, string > MPIIS;
typedef map< PII, PII > MPIIPII;
typedef multimap< int, int > MMII;
//typedef unordered_map< int, int > uMII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-6;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 1e4 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

int r, c, n, T;
string str; 
PII sheet[57][57];
MPIIPII mpp;
MSI op = {MP("DR", 0), MP("DC", 1), MP("IR", 2), MP("IC", 3), MP("EX", 4)};

void printSheet() {
    For(i, 1, r) 
        For(j, 1, c) 
            cout << "[" << sheet[i][j].ft << ", " << sheet[i][j].sd << "]" << " \n"[j == c];
}

// 将第 x 行替换成第 y 行 
void replaceRow(int x, int y) {
    if(x == y) return;
    For(j, 1, c) {
        mpp[sheet[y][j]] = MP(x, j);
        sheet[x][j] = sheet[y][j];
    }
}

// 将第 x 列替换成第 y 列
void replaceCol(int x, int y) {
    if(x == y) return;
    For(i, 1, r) {
        mpp[sheet[i][y]] = MP(i, x);
        sheet[i][x] = sheet[i][y];
    }
}

void removeRow(int x) {
    For(j, 1, c) {
        mpp[sheet[x][j]] = MP(-1, -1);
        sheet[x][j] = MP(-1, -1);
    }
}

void removeCol(int x) {
    For(i, 1, r) {
        mpp[sheet[i][x]] = MP(-1, -1);
        sheet[i][x] = MP(-1, -1);
    }
}

void insertRow(int x) {
    For(j, 1, c) sheet[x][j] = MP(-1, -1);    
}

void insertCol(int x) {
    For(i, 1, r) sheet[i][x] = MP(-1, -1);
}

void DR() {
    int n, x, newr = 0;
    SI si;
    cin >> n;
    Rep(i, n) {
        cin >> x;
        si.insert(x);
    }
    For(i, 1, r) {
        if(si.find(i) != si.end()) removeRow(i);
        else replaceRow(++newr, i);
    }
    r = newr;
}

void DC() {
    int n, x, newc = 0;
    SI si;
    cin >> n;
    Rep(i, n) {
        cin >> x;
        si.insert(x);
    }
    For(i, 1, c) {
        if(si.find(i) != si.end()) removeCol(i);
        else replaceCol(++newc, i);
    }
    c = newc;
}

void IR() {
    int n, x, newr;
    SI si;
    cin >> n;
    Rep(i, n) {
        cin >> x;
        si.insert(x);
    }
    newr = r + si.size();
    rFor(i, r, 1) {
        replaceRow(newr--, i);
        if(si.find(i) != si.end()) insertRow(newr--);
    }
    r = r + si.size();
}

void IC() {
    int n, x, newc;
    SI si;
    cin >> n;
    Rep(i, n) {
        cin >> x;
        si.insert(x);
    }
    newc = c + si.size();
    rFor(i, c, 1) {
        replaceCol(newc--, i);
        if(si.find(i) != si.end()) insertCol(newc--);
    }
    c = c + si.size();
}

void EX() {
    int x, y, a, b;
    cin >> x >> y >> a >> b;
    swap(sheet[x][y], sheet[a][b]);
    mpp[sheet[x][y]] = MP(x, y);
    mpp[sheet[a][b]] = MP(a, b);
}

void (*func[5])() = {DR, DC, IR, IC, EX};

int main(){
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    INIT();
    while(cin >> r >> c) {
        if(r == 0) break;
        mpp.clear();
        For(i, 1, r) {
            For(j, 1, c) {
                sheet[i][j] = MP(i, j);
                mpp[MP(i, j)] = MP(i, j);
            }
        }
        
        cin >> n;
        Rep(i, n) {
            cin >> str;
            func[op[str]]();
            //prln(str);
            //printSheet();
        }
        
        if(T) cout << endl;
        cout << "Spreadsheet #" << ++T << endl;
        cin >> n;
        Rep(i, n) {
            int x, y;
            cin >> x >> y;
            cout << "Cell data in (" << x << "," << y;
            if(mpp[MP(x, y)] == MP(-1, -1)) cout << ") GONE\n";
            else cout << ") moved to (" << mpp[MP(x, y)].ft << "," << mpp[MP(x, y)].sd << ")\n";
        }
    }
    return 0;
}