标签：
| Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
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.
as shown in the diagram
below:
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 aretain 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:
自己打了遍紫书中的代码。
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
const int MAXN = 30;
int n;
vector<int>pile[MAXN];
//找出木块所在的pile和height，以引用的方式返回调用者
void find_block(int x, int &p, int &h)
{
for (p = 0; p < n; p++)
for (h = 0; h < pile[p].size(); h++)
{
if (pile[p][h] == x) return;
}
}
//把第p堆高度为h的木块上方的所有木块移回原位
void clear_above(int p, int h)
{
for (int i = h + 1; i < pile[p].size(); i++)
{
int b = pile[p][i];
pile[b].push_back(b);
}
pile[p].resize(h + 1); //第p堆只应保留下标0到h的元素
}
//将第p堆高度为h及其上方的木块整体移动到p2的堆的顶部
void pile_onto(int p, int h, int p2)
{
for (int i = h; i < pile[p].size(); i++)
pile[p2].push_back(pile[p][i]);
pile[p].resize(h);
}
void print()
{
for (int i = 0; i < n; i++)
{
cout << i << ':';
for (int j = 0; j < pile[i].size(); j++)
cout << " " << pile[i][j];
cout << endl;
}
}
int main()
{
cin >> n;
int a, b;
string s1, s2;
for (int i = 0; i < n; i++)
pile[i].push_back(i);
while (cin >>s1)
{
if (s1 == "quit") break;
cin >> a >> s2 >> b;
int pa, ha, pb, hb;
find_block(a, pa, ha);
find_block(b, pb, hb);
if (pa == pb) continue; //非法指令
if (s2 == "onto") clear_above(pb, hb); //哇喔...
if (s1 == "move") clear_above(pa, ha);
pile_onto(pa, ha, pb);
}
print();
}UVA - 101 The Blocks Problem（STL，模拟）
标签：
原文地址：http://blog.csdn.net/qq_18738333/article/details/44990341
