UVa 101 The Blocks Problem (超级模拟)
来源:互联网 发布:ip绑定域名查询 编辑:程序博客网 时间:2024/06/03 23:53
101 - The Blocks Problem
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=37
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 ton-1) with block bi adjacent to block bi+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 blockb, 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.
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
10move 9 onto 1move 8 over 1move 7 over 1move 6 over 1pile 8 over 6pile 8 over 5move 2 over 1move 4 over 9quit
Sample Output
0: 0 1: 1 9 2 4 2: 3: 3 4: 5: 5 8 7 6 6: 7: 8: 9:
耐心点。。。
完整代码:
/*0.019s*/#include<cstdio>int block[25][25], num[25], top[25];char s[10], s2[10];void rel(int l){int u;for (int i = 0; i < num[top[l]]; i++) if (block[top[l]][i] == l) u = i;for (int i = u + 1; i < num[top[l]]; i++){block[block[top[l]][i]][num[block[top[l]][i]]] = block[top[l]][i];num[block[top[l]][i]]++;top[block[top[l]][i]] = block[top[l]][i];}num[top[l]] = u + 1;}//move a onto bvoid mo(int l, int r){rel(l);rel(r);block[top[r]][num[top[r]]] = l;num[top[r]]++;num[top[l]]--;top[l] = top[r];}//move a over bvoid mv(int l, int r){rel(l);block[top[r]][num[top[r]]] = l;num[top[r]]++;num[top[l]]--;top[l] = top[r];}//pile a onto bvoid po(int l, int r){rel(r);int u;for (int i = 0; i < num[top[l]]; i++) if (block[top[l]][i] == l) u = i;int e = num[top[l]];int f = top[l];for (int i = u; i < e; i++){block[top[r]][num[top[r]]] = block[f][i];num[top[r]]++;top[block[f][i]] = top[r];}num[f] = u;}//pile a over bvoid pv(int l, int r){int u;for (int i = 0; i < num[top[l]]; i++) if (block[top[l]][i] == l) u = i;int e = num[top[l]];int f = top[l];for (int i = u; i < e; i++){block[top[r]][num[top[r]]] = block[f][i];num[top[r]]++;top[block[f][i]] = top[r];}num[f] = u;}int main(void){int n;int l, r;scanf("%d\n", &n);for (int i = 0; i < n; i++){block[i][0] = i;num[i] = 1;top[i] = i;}while (scanf("%s", s), s[0] != 'q'){scanf("%d%s%d\n", &l, s2, &r);if (top[l] == top[r]) continue;if (s[0] == 'm'){if (s2[1] == 'n') mo(l, r);else mv(l, r);}else //s[0] == 'p'{if (s2[1] == 'n') po(l, r);else pv(l, r);}}for (int i = 0; i < n; i++){printf("%d:", i);for (int j = 0; j < num[i]; j++)printf(" %d", block[i][j]);putchar('\n');}return 0;}
- UVa 101 The Blocks Problem (超级模拟)
- Uva 101 - The Blocks Problem//简单模拟
- Uva 101 - The Blocks Problem//简单模拟
- UVA 101 - The Blocks Problem(模拟)
- uva 101 The Blocks Problem(模拟)
- uva 101 - The Blocks Problem(模拟)
- uva 101 The Blocks Problem (模拟)
- UVA 101 The Blocks Problem(模拟)
- UVa 101 The Blocks Problem [模拟]
- The Blocks Problem UVA 101 模拟
- uva 101 The Blocks Problem 模拟
- UVa-101 The Blocks Problem(栈模拟)
- UVa 101 - The Blocks Problem 栈模拟 TLE
- uva 101 The Blocks Problem (基本算法-模拟)
- uva 101 The Blocks Problem(模拟栈)
- uva-101 && poj 1208 The Blocks Problem (模拟栈)
- UVA - 101 The Blocks Problem(STL,模拟)
- 假期训练——The Blocks Problem UVA - 101 模拟
- opendaylight笔记1.openflow
- Python 标准库 urllib2 的使用细节
- 将mysql数据库设置成utf8编码时插入查询中文乱码
- 顺序表数据结构及基本运算
- Java运算符
- UVa 101 The Blocks Problem (超级模拟)
- 什么叫面向接口编程
- 软件安装:原始码与Tarball
- POJ 1328 Radar Installation 贪心
- 实现字符串中数字字符向数字转换
- 考研日记2013.9.21
- 科大讯飞2012合肥笔试题
- mysql mvcc理解
- CocoaPods:管理Objective-c 程序中各种第三方开源库关联