The Blocks Problem (积木问题) UVa OJ 101
| The Blocks Problem |
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 b i adjacent to block b i+1 for all as shown in the diagram below: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 b to 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 aretain their original order when moved.
- quit
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 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 ( 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:
2000-04-06
这道题我从下午一直做到晚上9点多，途中请教了一位同学，讨论2个小时之久，再经过自己1个多小时的测试数据，调试，终于找到错误，自己太不小心，在此一定要感谢乐于助人的hcbbt同学，思路很简单就是模拟，我是用vector模拟的。。
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
vector<int> bricks[30];
int arry[30];
int main()
{
int n,i;
cin>>n;
for(i=0;i<n;i++)
{
bricks[i].push_back(i);
arry[i]=i;
}
string str1;
while(cin>>str1&&str1!="quit")
{
int m,t,j,k,dm1=0,dt1=0,dm2=0,dt2=0;
string str2;
cin>>m>>str2>>t;
if(m==t) continue;
if(arry[m]==arry[t]) continue;
dm1=arry[m],dt1=arry[t];
for(i=0;i<bricks[dm1].size();i++)
{
if(bricks[dm1][i]==m)
{
dm2=i;
break;
}
}
for(i=0;i<bricks[dt1].size();i++)
{
if(bricks[dt1][i]==t)
{
dt2=i;
break;
}
}
if(str1=="move"&&str2=="onto")
{
while(bricks[dm1].back()!=m)
{
bricks[bricks[dm1].back()].push_back(bricks[dm1].back());
arry[bricks[dm1].back()]=bricks[dm1].back();
bricks[dm1].pop_back();
}
while(bricks[dt1].back()!=t)
{
bricks[bricks[dt1].back()].push_back(bricks[dt1].back());
arry[bricks[dt1].back()]=bricks[dt1].back();
bricks[dt1].pop_back();
}
bricks[dt1].push_back(bricks[dm1].back());
arry[bricks[dm1].back()]=dt1;
bricks[dm1].pop_back();
}
else if(str1=="move"&&str2=="over")
{
while(bricks[dm1].back()!=m)
{
bricks[bricks[dm1].back()].push_back(bricks[dm1].back());
arry[bricks[dm1].back()]=bricks[dm1].back();
bricks[dm1].pop_back();
}
bricks[dt1].push_back(bricks[dm1].back());
arry[bricks[dm1].back()]=dt1;
bricks[dm1].pop_back();
}
else if(str1=="pile"&&str2=="onto")
{
while(bricks[dt1].back()!=t)
{
bricks[bricks[dt1].back()].push_back(bricks[dt1].back());
arry[bricks[dt1].back()]=bricks[dt1].back();
bricks[dt1].pop_back();
}
bricks[dt1].insert(bricks[dt1].begin()+dt2,bricks[dm1].begin()+dm2,bricks[dm1].end());
for(k=dm2;k<bricks[dm1].size();k++)
{
arry[bricks[dm1][k]]=dt1;
}
bricks[dm1].erase(bricks[dm1].begin()+dm2,bricks[dm1].end());
}
else if(str1=="pile"&&str2=="over")
{
bricks[dt1].insert(bricks[dt1].end(),bricks[dm1].begin()+dm2,bricks[dm1].end());
for(k=dm2;k<bricks[dm1].size();k++)
{
arry[bricks[dm1][k]]=dt1;
}
bricks[dm1].erase(bricks[dm1].begin()+dm2,bricks[dm1].end());
}
}
int d;
for(i=0;i<n;i++)
{
cout<<i<<":";
for(d=0;d<bricks[i].size();d++)
{
cout<<" "<<bricks[i][d];
}
cout<<endl;
}
return 0;
}