标签:
Spreadsheet Tracking |
Data in spreadsheets are stored in cells, which are organized in rows (r) and columns (c). Some operations on spreadsheets can be applied to single cells (r,c), while others can be applied to entire rows or columns. Typical cell operations include inserting and deleting rows or columns and exchanging cell contents.
Some spreadsheets allow users to mark collections of rows or columns for deletion, so the entire collection can be deleted at once. Some (unusual) spreadsheets allow users to mark collections of rows or columns for insertions too. Issuing an insertion command
results in new rows or columns being inserted before each of the marked rows or columns. Suppose, for example, the user marks rows 1 and 5 of the spreadsheet on the left for deletion. The spreadsheet then shrinks to the one on the right.
If the user subsequently marks columns 3, 6, 7, and 9 for deletion, the spreadsheet shrinks to this.
1 | 2 | 3 | 4 | 5 | |
1 | 2 | 24 | 8 | 22 | 16 |
2 | 18 | 19 | 21 | 22 | 25 |
3 | 24 | 25 | 67 | 22 | 71 |
4 | 16 | 12 | 10 | 22 | 58 |
5 | 33 | 34 | 36 | 22 | 40 |
If the user marks rows 2, 3 and 5 for insertion, the spreadsheet grows to the one on the left. If the user then marks column 3 for insertion, the spreadsheet grows to the one in the middle. Finally, if the user exchanges the contents of cell (1,2) and cell (6,5), the spreadsheet looks like the one on the right.
You must write tracking software that determines the final location of data in spreadsheets that result from row, column, and exchange operations similar to the ones illustrated here.
An operation to exchange the contents of cell (r1, c1) with the contents of cell (r2, c2) is given by:
EXr1c1r2c2
The four insert and delete commands--DC (delete columns), DR (delete rows), IC (insert columns), and IR (insert rows) are given by:
<command> Ax1x2xA
where <command> is one of the four commands; A is a positive integer less than 10, and are the labels of
the columns or rows to be deleted or inserted before. For each insert and delete command, the order of the rows or columns in the command has no significance. Within a single delete or insert command, labels will be unique.
The operations are followed by an integer which is the number of queries for the spreadsheet. Each query consists of positive integers rand c, representing the row and column number of a cell in the original spreadsheet. For each query, your
program must determine the current location of the data that was originally in cell (r, c). The end of input is indicated by a row consisting of a pair of zeros for the spreadsheet dimensions.
The data file will not contain a sequence of commands that will cause the spreadsheet to exceed the maximum size.
7 9 5 DR 2 1 5 DC 4 3 6 7 9 IC 1 3 IR 2 2 4 EX 1 2 6 5 4 4 8 5 5 7 8 6 5 0 0
Spreadsheet #1 Cell data in (4,8) moved to (4,6) Cell data in (5,5) GONE Cell data in (7,8) moved to (7,6) Cell data in (6,5) moved to (1,2)
#include <iostream> #include <stdio.h> #include <string> #include <cstring> #include <algorithm> #include <cmath> #define N 10009 using namespace std; struct Command { char c[50]; int r1,c1,r2,c2; int a,x[50]; }cmd[N]; int r,c,n; 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; } int main() { int r0,c0,q,ca=0; while(scanf("%d%d",&r,&c)!=EOF) { if(r+c==0) break; scanf("%d",&n); 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(ca>0) cout<<endl; printf("Spreadsheet #%d\n",++ca); scanf("%d",&q); while(q--) { scanf("%d%d",&r0,&c0); printf("Cell data in (%d,%d) ",r0,c0); if(!simulate(&r0,&c0)) cout<<"GONE"<<endl; else printf("moved to (%d,%d)\n",r0,c0); } } return 0; }
标签:
原文地址:http://blog.csdn.net/wust_zjx/article/details/42833749