此题在算法竞赛入门经典第二版中85页有详解,我先自己想了一下思路,然后看书上的思路,发现书上第二中方法的思路非常的巧妙,在不看代码的情况下自己实现了,特此标记。
题目详细在最下方,这里先总结我的一点小小的心得。
此题模拟Excel的变换,最首先想到的思路是用一个二维数组来模拟该操作,只不过这样子会使整个算法效率很地底下,但是较为容易想到。
另一种思路,变换类型的题,但凡他是要求结果不论过程的,我们完全可以不用按过程全部实现,在此题,只需要实现他要查看的数的变换即可。这里的思路是每一次变换后,要查每一个数,每次只需要对每一个数进行变换即可,不用存储下中间结果。这样子针对若干大个数的变换操作就会变成对一个数的变换操作,感觉一下容易了很多。
UVA 512 - 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.
22 | 55 | 66 | 77 | 88 | 99 | 10 | 12 | 14 |
2 | 24 | 6 | 8 | 22 | 12 | 14 | 16 | 18 |
18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 |
24 | 25 | 26 | 67 | 22 | 69 | 70 | 71 | 77 |
68 | 78 | 79 | 80 | 22 | 25 | 28 | 29 | 30 |
16 | 12 | 11 | 10 | 22 | 56 | 57 | 58 | 59 |
33 | 34 | 35 | 36 | 22 | 38 | 39 | 40 | 41 |
2 | 24 | 6 | 8 | 22 | 12 | 14 | 16 | 18 |
18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 |
24 | 25 | 26 | 67 | 22 | 69 | 70 | 71 | 77 |
16 | 12 | 11 | 10 | 22 | 56 | 57 | 58 | 59 |
33 | 34 | 35 | 36 | 22 | 38 | 39 | 40 | 41 |
If the user subsequently marks columns 3, 6, 7, and 9 for deletion, the spreadsheet shrinks to this.
2 | 24 | 8 | 22 | 16 |
18 | 19 | 21 | 22 | 25 |
24 | 25 | 67 | 22 | 71 |
16 | 12 | 10 | 22 | 58 |
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.
2 | 24 | 8 | 22 | 16 |
18 | 19 | 21 | 22 | 25 |
24 | 25 | 67 | 22 | 71 |
16 | 12 | 10 | 22 | 58 |
33 | 34 | 36 | 22 | 40 |
2 | 24 | 8 | 22 | 16 |
18 | 19 | 21 | 22 | 25 |
24 | 25 | 67 | 22 | 71 |
16 | 12 | 10 | 22 | 58 |
33 | 34 | 36 | 22 | 40 |
2 | 22 | 8 | 22 | 16 |
18 | 19 | 21 | 22 | 25 |
24 | 25 | 67 | 22 | 71 |
16 | 12 | 10 | 24 | 58 |
33 | 34 | 36 | 22 | 40 |
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.
Input
The input consists of a sequence of spreadsheets, operations on those spreadsheets, and queries about
them. Each spreadsheet definition begins with a pair of integers specifying its initial number of rows
(r) and columns (c), followed by an integer specifying the number (n) of spreadsheet operations. Row
and column labeling begins with 1. The maximum number of rows or columns of each spreadsheet is
limited to 50. The following n lines specify the desired operations.
An operation to exchange the contents of cell (r1; c1) with the contents of cell (r2; c2) is given by:
EX r1 c1 r2 c2
The four insert and delete commands|DC (delete columns), DR (delete rows), IC (insert columns),
and IR (insert rows) are given by:
< command > A x1 x2 : : : xA
where < command > is one of the four commands; A is a positive integer less than 10, and x1; : : : ; xA
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 r and 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.
Output
For each spreadsheet, your program must output its sequence number (starting at 1). For each query,
your program must output the original cell location followed by the final location of the data or the
word ‘GONE’ if the contents of the original cell location were destroyed as a result of the operations.
Separate output from different spreadsheets with a blank line.
The data file will not contain a sequence of commands that will cause the spreadsheet to exceed the
maximum size.
Sample Input
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
Sample Output
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)