Background
Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in which a robot arm performed tasks involving the manipulation of blocks.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 Problem
The problem is to parse a series of commands that instruct a robot arm in how to manipulate blocks that lie on a flat table. Initially there are n blocks on the table (numbered from 0 to n-1) with block bi adjacent to block bi+1 for all 0 ≤ i < n − 1 as shown in the diagram below:
Initial Blocks World
The valid commands for the robot arm that manipulates blocks are:
- move a onto b 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 bto their initial positions.
- move a over b 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.
- pile a onto b 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.
- pile a over b 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.
- quitterminates manipulations in the block world.
The Input
The input begins with an integer n on a line by itself representing the number of blocks in the block world. You may assume that 0 < n< 25.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
The output should consist of the final state of the blocks world. Each original block position numbered i ( 0 ≤ i < n 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).Sample 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
Sample Output
0: 0 1: 1 9 2 4 2: 3: 3 4: 5: 5 8 7 6 6: 7: 8: 9:
解題方法：這題最重要的是要明白題意，不會太難。從題目的要求發現可以採用Stack進行實作。
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;
import java.util.StringTokenizer;
public class UvA101 {
public static Stack blocks[];
public static int[] position;
public static int numberOfblocks;
public static String command ="";
public static int a,b;
public static void main(String[] args) throws IOException{
// Defined Variable
BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
numberOfblocks = Integer.parseInt(buf.readLine());
blocks = new Stack[numberOfblocks];
position = new int[numberOfblocks];
for(int i = 0; i < numberOfblocks; i++) {
blocks[i] = new Stack(); // Initial number of empty stack
blocks[i].push(i);
position[i] = i;
}
while(!(command=buf.readLine()).equals("quit")){
StringTokenizer token = new StringTokenizer(command);
String aWord = token.nextToken();
a = Integer.parseInt(token.nextToken());
String bWord = token.nextToken();
b = Integer.parseInt(token.nextToken());
if(a==b || position[a]==position[b])
continue;
if(aWord.equals("move"))
{
if(bWord.equals("onto"))
{
moveOnto(a,b);
}
else if(bWord.equals("over"))
{
moveOver(a,b);
}
}
else if(aWord.equals("pile"))
{
if(bWord.equals("onto"))
{
pileOnto(a,b);
}
else if(bWord.equals("over"))
{
pileOver(a,b);
}
}
}
for(int i = 0; i < blocks.length; i++)
System.out.println(answer(i));
}
public static void moveOnto(int a, int b) {
clearAbove(b);
moveOver(a, b);
}
public static void moveOver(int a, int b) {
clearAbove(a);
blocks[position[b]].push(blocks[position[a]].pop());
position[a] = position[b];
}
public static void pileOnto(int a, int b) {
clearAbove(b);
pileOver(a, b);
}
public static void pileOver(int a, int b) {
Stack pile = new Stack();
while(blocks[position[a]].peek() != a) {
pile.push(blocks[position[a]].pop());
}
pile.push(blocks[position[a]].pop());
while(!pile.isEmpty()) {
int Tmp = pile.pop();
blocks[position[b]].push(Tmp);
position[Tmp] = position[b];
}
}
public static void clearAbove(int block) {
while(blocks[position[block]].peek() != block) {
initial(blocks[position[block]].pop());
}
}
/*
* Initial the blocks
*/
public static void initial(int block) {
while(!blocks[block].isEmpty()) {
initial(blocks[block].pop());
}
blocks[block].push(block);
position[block] = block;
}
public static String answer(int index) {
String Result = "";
while(!blocks[index].isEmpty()) Result = " " + blocks[index].pop() + Result;
Result = index + ":" + Result;
return Result;
}
}
