poj1208_The Blocks Problem || uva101
2016-04-15 22:02
441 查看
The Blocks Problem
Description
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 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:
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 a retain 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.
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.
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
Sample Output
<span style="font-size:18px;">#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;
#define INT_MAX 1 << 30
typedef long long ll;
int n;
const int MAX = 30;
vector<int>block[MAX];
void find (int x,int& y,int& z) //找到x所对应的block位置y及其高度z
{
for (y = 0; y < n; y += 1)
{
for (z = 0; z < block[y].size(); z += 1)
{
if(block[y][z] == x)
return;
}
}
}
void clear_(int blockc,int height) // 清除块blockc中高度height上木块并将其放回原处
{
for (unsigned int i = height+1; i < block[blockc].size(); i += 1)
{
int c = block[blockc][i];
block[c].push_back(c);
}
block[blockc].resize(height+1);
}
void transit(unsigned int blocka,int ha,int blockb) //将blocka上高度从ha到顶的木块放到blockb上
{
for (unsigned int i = ha; i < block[blocka].size(); i += 1)
{
block[blockb].push_back(block[blocka][i]);
}
block[blocka].resize(ha);
}
void print() //输出函数,写在外面方便调试
{
for (int i = 0; i < n; i += 1)
{
printf("%d:", i);
for (int j = 0; j < block[i].size(); j += 1)
{
printf(" %d", block[i][j]);
}
printf("\n");
}
}
int main()
{
int a,b;
char s1[5],s2[5];
cin >> n;
for (int i = 0; i < n; i += 1)
{
block[i].clear();
block[i].push_back(i);
}
while (scanf("%s",s1)&&(s1[0]!='q'))
{
scanf("%d%s%d",&a,s2,&b);
int blocka,blockb,ha,hb;
find(a,blocka,ha);
find(b,blockb,hb);
if(blocka == blockb)
continue;
if (s2 == "onto")
{
clear_(blockb,hb);
}
if (s1 == "move")
{
clear_(blocka,ha);
}
transit(blocka,ha,blockb);
}
print();
return 0;
}</span>
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 5300 | Accepted: 2279 |
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 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:
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 a retain 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.
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.
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:
<span style="font-size:18px;">#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;
#define INT_MAX 1 << 30
typedef long long ll;
int n;
const int MAX = 30;
vector<int>block[MAX];
void find (int x,int& y,int& z) //找到x所对应的block位置y及其高度z
{
for (y = 0; y < n; y += 1)
{
for (z = 0; z < block[y].size(); z += 1)
{
if(block[y][z] == x)
return;
}
}
}
void clear_(int blockc,int height) // 清除块blockc中高度height上木块并将其放回原处
{
for (unsigned int i = height+1; i < block[blockc].size(); i += 1)
{
int c = block[blockc][i];
block[c].push_back(c);
}
block[blockc].resize(height+1);
}
void transit(unsigned int blocka,int ha,int blockb) //将blocka上高度从ha到顶的木块放到blockb上
{
for (unsigned int i = ha; i < block[blocka].size(); i += 1)
{
block[blockb].push_back(block[blocka][i]);
}
block[blocka].resize(ha);
}
void print() //输出函数,写在外面方便调试
{
for (int i = 0; i < n; i += 1)
{
printf("%d:", i);
for (int j = 0; j < block[i].size(); j += 1)
{
printf(" %d", block[i][j]);
}
printf("\n");
}
}
int main()
{
int a,b;
char s1[5],s2[5];
cin >> n;
for (int i = 0; i < n; i += 1)
{
block[i].clear();
block[i].push_back(i);
}
while (scanf("%s",s1)&&(s1[0]!='q'))
{
scanf("%d%s%d",&a,s2,&b);
int blocka,blockb,ha,hb;
find(a,blocka,ha);
find(b,blockb,hb);
if(blocka == blockb)
continue;
if (s2 == "onto")
{
clear_(blockb,hb);
}
if (s1 == "move")
{
clear_(blocka,ha);
}
transit(blocka,ha,blockb);
}
print();
return 0;
}</span>
相关文章推荐
- C++ Vector用法详解
- 大家注意vector, list, set, map成员函数erase
- java中vector与hashtable操作实例分享
- C++ vector删除符合条件的元素示例分享
- C++ Vector用法深入剖析
- vector与map的erase()函数详细解析
- vector,map,list,queue的区别详细解析
- C++ vector的用法小结
- stl容器set,map,vector之erase用法与返回值详细解析
- C++中vector的用法实例解析
- c++ vector(向量)使用方法详解(顺序访问vector的多种方式)
- 关于STL中vector容器的一些总结
- JAVA Vector源码解析和示例代码
- Java中的Vector和ArrayList区别及比较
- 浅谈 java中ArrayList、Vector、LinkedList的区别联系
- 重新认识java-Vector
- Java中Vector和ArrayList的区别
- Vector 还是ArrayList
- vector-list-deque
- java集合类Vector与Enumeration用法举例