标签：
Description
In this problem you will model a simple block world under certain rules and constraints. Rather than determine how to achieve a specified state, you will ``program‘‘ a robotic arm to respond to a limited set of commands.
The valid commands for the robot arm that manipulates blocks are:
where a and b are block numbers, puts block a onto block b after returning any blocks that are stacked on top of blocks a and b to their initial positions.
where a and b are block numbers, puts block a onto the top of the stack containing block b, after returning any blocks that are stacked on top of block a to their initial positions.
where a and b are block numbers, moves the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto block b. All blocks on top of block b are moved to their initial positions prior to the pile taking place. The blocks stacked above block a retain their order when moved.
where a and b are block numbers, puts the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto the top of the stack containing block b. The blocks stacked above block a retain their original order when moved.
terminates manipulations in the block world.
Any command in which a = b or in which a and b are in the same stack of blocks is an illegal command. All illegal commands should be ignored and should have no affect on the configuration of blocks.
The number of blocks is followed by a sequence of block commands, one command per line. Your program should process all commands until the quit command is encountered.
You may assume that all commands will be of the form specified above. There will be no syntactically incorrect commands.
The output should consist of the final state of the blocks world. Each original block position numbered i ( where n is the number of blocks) should appear followed immediately by a colon. If there is at least a block on it, the colon must be followed by one space, followed by a list of blocks that appear stacked in that position with each block number separated from other block numbers by a space. Don‘t put any trailing spaces on a line.
There should be one line of output for each block position (i.e., n lines of output where n is the integer on the first line of input).
10 move 9 onto 1 move 8 over 1 move 7 over 1 move 6 over 1 pile 8 over 6 pile 8 over 5 move 2 over 1 move 4 over 9 quit
0: 0 1: 1 9 2 4 2: 3: 3 4: 5: 5 8 7 6 6: 7: 8: 9:
这道题的题解引用自：http://blog.csdn.net/mobius_strip/article/details/12765319
题意：给你n个方块，有四种操作：
1.move a onto b，把a和b上面的方块都放回原来位置，然后把a放到b上面；
2.move a over b，把a上面的放回原处，然后把a放在b所在的方块堆的上面；
3.pile a onto b，把b上面的放回原来位置，然后把a和a上面的方块整体放到b上面；
4.pile a over b，把a和a上面的方块整体放到b所在堆的上面。
分析：模拟，数据结构。观察操作，如果是move就是先把a上面的还原，如果是onto就是先把b上面的还原。
然后，就是移动一堆到另一堆的上面（单个也认为是一堆）。所以设置两个基础操作：
1.将a上面的还原init_place(a)；
2.将a和上面的（可以没有上面的）放到b上面pile_a_to_b(a,b)。
那么上述的四组操作就变成下面了：
1.move a onto b，init_place(a)；init_place(b)；pile_a_to_b(a,b)；
2.move a over b，init_place(a)；pile_a_to_b(a,b)；
3.pile a onto b，init_place(b)；pile_a_to_b(a,b)；
4.pile a over b，pile_a_to_b(a,b)。
利用两个操作轻松解决。具体实现时设置一个place数组记录每个编号的方块对应的堆。
注意：如果a和b已经在一堆中就不要操作，此时认为不用移动，否则会WA。
1 #include <iostream> 2 #include <cstdlib> 3 #include <cstdio> 4 5 using namespace std; 6 7 int place[25]; 8 int stack[25][25]; 9 int top[25]; 10 11 //将a上面的放回原位 12 void init_place( int a ) 13 { 14 int block,id = place[a]; 15 while ( stack[id][top[id]] != a ) { 16 block = stack[id][top[id] --]; 17 place[block] = block; 18 stack[block][++ top[block]] = block; 19 } 20 } 21 22 //将a和上面的全都移动到b上 23 int temp[25]; 24 void pile_a_to_b( int a, int b ) 25 { 26 int topt = -1,id = place[a],ID = place[b]; 27 //先将a上面的逆序存入temp 28 while ( stack[id][top[id]] != a ) 29 temp[++ topt] = stack[id][top[id] --]; 30 //再存入a 31 place[a] = ID; 32 stack[ID][++ top[ID]] = a; 33 top[id] --; 34 //最后将temp里面的逆序存入b 35 while ( topt >= 0 ) { 36 place[temp[topt]] = ID; 37 stack[ID][++ top[ID]] = temp[topt --]; 38 } 39 } 40 41 int main() 42 { 43 int n,a,b; 44 char oper[5],type[5]; 45 while ( ~scanf("%d",&n) ) { 46 for ( int i = 0 ; i < n ; ++ i ) { 47 stack[i][0] = i; 48 place[i] = i; 49 top[i] = 0; 50 } 51 while ( scanf("%s",oper) && oper[0] != ‘q‘ ) { 52 scanf("%d%s%d",&a,type,&b); 53 54 //如果ab在同一堆，不处理 55 if ( place[a] == place[b] ) 56 continue; 57 58 //如果是move先把a上面的还原 59 if ( oper[0] == ‘m‘ ) 60 init_place( a ); 61 62 //如果是onto先把b上面的还原 63 if ( type[1] == ‘n‘ ) 64 init_place( b ); 65 66 //把A堆放在B堆上 67 pile_a_to_b( a, b ); 68 } 69 70 for ( int i = 0 ; i < n ; ++ i ) { 71 printf("%d:",i); 72 int now = 0; 73 while ( now <= top[i] ) 74 printf(" %d",stack[i][now ++]); 75 printf("\n"); 76 } 77 } 78 return 0; 79 }
标签：
原文地址：http://www.cnblogs.com/cyb123456/p/5797715.html
uDebug
