Solution1:
#include <algorithm>
#include <iostream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <sstream>
#include <cstdio>
#include <deque>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <list>
using namespace std;
typedef long long LL;
typedef long long ll;
#define mm(a,i) memset(a, i, sizeof(a));
#define Mod 1000000007
#define SC_C(s) scanf("%c", &s)
#define SC(a) scanf("%d", &a)
#define SCC(a,b) scanf("%d %d", &a, &b)
#define SCCC(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define FXA(i,a,n) for(int i=a; i<n; i++)
#define FDA(i,a,n) for(i=a; i>n; i++)
#define FXDA(i,a,n) for(i=a; i<=n; i++)
#define FDDA(i,a,n) for(i=a; i>=n; i++)
#define FXB(i,a,n) for(i=a; i<n; i--)
#define FDB(i,a,n) for(i=a; i>n; i--)
#define FXDB(i,a,n) for(i=a; i<=n; i--)
#define FDDB(i,a,n) for(i=a; i>=n; i--)
#define PF(n) printf("%d\n", n);
#define PFF(n,m) printf("%d %d\n", n, m);
#define PFFF(x,y,z) printf("%d %d %d\n", x, y, z);
#define PF_Case(i) printf("Case #%d:\n",i);
#define PF_C(i) printf("%c:\n",i);
#define PF_L(x) printf("%I64d\n",x);
#define IN freopen("D:\\in.txt","r",stdin);
#define ENT printf("\n");
#define MAX(a,b) a>b?a:b
#define MIN(a,b) a<b?a:b
const int INF = 0x3fffffff;
const int BIG = 10000;
const int maxd = 100;
int r, c, n, d[maxd][maxd], d2[maxd][maxd], ans[maxd][maxd], cols[maxd];
void in() {
#ifndef ONLINE_JUDGE
IN;
#endif // ONLINE_JUDGE
}
void cpy (char type, int p, int q) {
if(type == 'R') {
for(int i=1; i<=c; i++) {
d[p][i] = d2[q][i];
}
} else {
for(int i=1; i<=r; i++) {
d[i][p] = d2[i][q];
}
}
}
void del(char type) {
memcpy(d2, d, sizeof(d));
int cnt = type=='R' ? r:c, cnt2=0;
for(int i=1; i<=cnt; i++) {
if(!cols[i])
cpy(type, ++cnt2, i);
}
if(type == 'R')
r = cnt2;
else c = cnt2;
}
void ins(char type) {
memcpy(d2, d, sizeof(d));
int cnt = type=='R' ? r:c, cnt2=0;
for(int i=1; i<=cnt; i++) {
if(cols[i])
cpy(type, ++cnt2, 0);
cpy(type, ++cnt2, i);
}
if(type == 'R')
r = cnt2;
else c = cnt2;
}
main() {
in();
int r1, c1, r2, c2, q, kase=0;
char cmd[10];
mm(d,0)
while(~SCCC(r,c,n)) {
if(r) {
int r0=r, c0=c;
for(int i=1; i<=r; i++) {
for(int j=1; j<=c; j++) {
d[i][j] = i*BIG+j;
// printf("%10d", d[i][j]);
}
// ENT
}
// cout<<r<<" "<<c<<endl;
while(n--) {
scanf("%s", cmd);
if(cmd[0] == 'E') {
scanf("%d%d%d%d", &r1, &c1, &r2, &c2);
swap(d[r1][c1], d[r2][c2]);
} else {
int a, x;
SC(a);
mm(cols,0)
for(int i=0; i<a; i++) {
SC(x);
cols[x] = 1;
}
if(cmd[0] == 'D') del(cmd[1]);
else ins(cmd[1]);
}
}
// cout<<r<<" "<<c<<endl;
// for(int i=1; i<15; i++) {
// for(int j=1; j<15; j++) {
// printf("%10d", d[i][j]);
// }
// ENT
// }
mm(ans,0)
// cout<<r0<<" "<<c0<<endl;
for(int i=1; i<=r; i++) {
for(int j=1; j<=c; j++) {
ans[d[i][j]/BIG][d[i][j]%BIG] = i*BIG+j;
// cout<<"yes"<<endl;
}
}
// for(int i=1; i<11; i++) {
// for(int j=1; j<11; j++) {
// printf("%10d", ans[i][j]);
// }
// ENT
// }
if(kase > 0) {
ENT
}
printf("Spreadsheet #%d\n", ++kase);
SC(q);
while(q--) {
SCC(r1, c1);
printf("Cell data in (%d,%d) ", r1, c1);
if(ans[r1][c1] == 0)
printf("GONE\n");
else printf("moved to (%d,%d)\n", ans[r1][c1]/BIG, ans[r1][c1]%BIG);
}
}
}
return 0;
}
Solution2:
#include <algorithm>
#include <iostream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <sstream>
#include <cstdio>
#include <deque>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <list>
using namespace std;
typedef long long LL;
typedef long long ll;
#define mm(a,i) memset(a, i, sizeof(a));
#define Mod 1000000007
#define SC_C(s) scanf("%c", &s)
#define SC(a) scanf("%d", &a)
#define SCC(a,b) scanf("%d %d", &a, &b)
#define SCCC(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define FXA(i,a,n) for(int i=a; i<n; i++)
#define FDA(i,a,n) for(i=a; i>n; i++)
#define FXDA(i,a,n) for(i=a; i<=n; i++)
#define FDDA(i,a,n) for(i=a; i>=n; i++)
#define FXB(i,a,n) for(i=a; i<n; i--)
#define FDB(i,a,n) for(i=a; i>n; i--)
#define FXDB(i,a,n) for(i=a; i<=n; i--)
#define FDDB(i,a,n) for(i=a; i>=n; i--)
#define PF(n) printf("%d\n", n);
#define PFF(n,m) printf("%d %d\n", n, m);
#define PFFF(x,y,z) printf("%d %d %d\n", x, y, z);
#define PF_Case(i) printf("Case #%d:\n",i);
#define PF_C(i) printf("%c:\n",i);
#define PF_L(x) printf("%I64d\n",x);
#define IN freopen("D:\\in.txt","r",stdin);
#define ENT printf("\n");
#define MAX(a,b) a>b?a:b
#define MIN(a,b) a<b?a:b
const int INF = 0x3fffffff;
const int BIG = 10000;
const int maxd = 100;
struct Command {
char c[5];
int r1, c1, r2, c2;
int a, x[20];
} cmd[maxd];
int r,c,n;
void in() {
#ifndef ONLINE_JUDGE
IN;
#endif // ONLINE_JUDGE
}
int simulate(int* r0, int* c0) {
for(int i=0; i<n; i++) {
if(cmd[i].c[0] == 'E') {
if(cmd[i].r1==*r0 && cmd[i].c1==*c0) {
*r0 = cmd[i].r2;
*c0 = cmd[i].c2;
} else if(cmd[i].r2==*r0 && cmd[i].c2==*c0) {
*r0 = cmd[i].r1;
*c0 = cmd[i].c1;
}
} else {
int dr=0, dc=0;
for(int j=0; j<cmd[i].a; j++) {
int x = cmd[i].x[j];
if(cmd[i].c[0] == 'I') {
if(cmd[i].c[1]=='R' && x<=*r0)
dr++;
if(cmd[i].c[1]=='C' && x<=*c0)
dc++;
} else {
if(cmd[i].c[1]=='R' && x==*r0)
return 0;
if(cmd[i].c[1]=='C' && x==*c0)
return 0;
if(cmd[i].c[1]=='R' && x<*r0)
dr--;
if(cmd[i].c[1]=='C' && x<*c0)
dc--;
}
}
*r0 += dr;
*c0 += dc;
}
}
return 1;
}
main() {
in();
int r0, c0, q, kase=0;
while(scanf("%d%d%d", &r, &c, &n)==3 && r) {
for(int i=0; i<n; i++) {
scanf("%s", cmd[i].c);
if(cmd[i].c[0] == 'E') {
scanf("%d%d%d%d", &cmd[i].r1, &cmd[i].c1, &cmd[i].r2, &cmd[i].c2);
} else {
scanf("%d", &cmd[i].a);
for(int j=0; j<cmd[i].a; j++)
scanf("%d", &cmd[i].x[j]);
}
}
if(kase > 0)
ENT;
printf("Spreadsheet #%d\n", ++kase);
scanf("%d", &q);
while(q--) {
scanf("%d%d", &r0, &c0);
printf("Cell data in (%d,%d) ", r0, c0);
if(!simulate(&r0, &c0))
printf("GONE\n");
else printf("moved to (%d,%d)\n", r0, c0);
}
}
return 0;
}