UVA The Blocks Problem

最新推荐文章于 2020-01-03 15:16:41 发布

hexiecs

最新推荐文章于 2020-01-03 15:16:41 发布

阅读量713

点赞数

分类专栏： ACM 文章标签： acm uva 模拟

ACM 同时被 3 个专栏收录

138 篇文章 0 订阅

订阅专栏

-----data structure

22 篇文章 0 订阅

订阅专栏

-----模拟

14 篇文章 0 订阅

订阅专栏

这道题自己一直WA，转载一篇别人的。。。代码写的很漂亮，虽然有四种操作，但操作之间的是有联系的，所以几个函数可以重用，这点很好。。

题目如下：

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 $0 \leq i < n-1$ as shown in the diagram below:

$\begin{figure}\centering\setlength{\unitlength}{0.0125in} %\begin{picture}(2......raisebox{0pt}[0pt][0pt]{$\bullet\bullet \bullet$ }}}\end{picture}\end{figure}$

Figure: 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 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.

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 \leq 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

别人的很漂亮的代码：

// UVa Problem 101 - The Blocks Problem
// Verdict: Accepted
// Submission Date: 2011-10-16
// UVa Run Time: 0.020s
//
// 版权所有（C）2011，邱秋。metaphysis # yeah dot net
//
// [解题方法]
// 模拟题，注意题意的操作中将方块返回原位置是指将方块 i 放到第 i 组方块最上方。

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      

using namespace std;

#define MAXN 25

int blocks[MAXN];
int state[MAXN][MAXN];
int nBlocks;

void returning(int x, pair < int, int > xIndex)
{
	for (int i = xIndex.second + 1; i < blocks[xIndex.first]; i++)
	{
		int tmp = state[xIndex.first][i];
		state[tmp][blocks[tmp]++] = tmp;
	}

	blocks[xIndex.first] = xIndex.second + 1;
}

void moveOver(int a, int b, pair < int, int > aIndex, pair < int, int > bIndex)
{
	returning(a, aIndex);

	state[bIndex.first][blocks[bIndex.first]++] = a;
	blocks[aIndex.first] = aIndex.second;
}

void moveOnto(int a, int b, pair < int, int > aIndex, pair < int, int > bIndex)
{
	returning(b, bIndex);
	moveOver(a, b, aIndex, bIndex);
}

void pileOver(int a, int b, pair < int, int > aIndex, pair < int, int > bIndex)
{
	int current = aIndex.second;
	while (current < blocks[aIndex.first])
		state[bIndex.first][blocks[bIndex.first]++] =
			state[aIndex.first][current++];

	blocks[aIndex.first] = aIndex.second;
}

void pileOnto(int a, int b, pair < int, int > aIndex, pair < int, int > bIndex)
{
	returning(b, bIndex);
	pileOver(a, b, aIndex, bIndex);
}

pair < int, int > findIndex(int x)
{
	for (int i = 0; i < nBlocks; i++)
		for (int j = 0; j < blocks[i]; j++)
			if (state[i][j] == x)
				return make_pair(i, j);
}

void print(void)
{
	for (int i = 0; i < nBlocks; i++)
	{
		cout << i << ":";
		for (int j = 0; j < blocks[i]; j++)
			cout << " " << state[i][j];
		cout << endl;
	}
}

int main(int ac, char *av[])
{
	int a, b, aIndex, bIndex;
	string command, action;

	cin >> nBlocks;
	for (int i = 0; i < nBlocks; i++)
	{
		blocks[i] = 0;
		state[i][blocks[i]++] = i;
	}

	while (cin >> command, strcmp(command.data(), "quit"))
	{
		cin >> a >> action >> b;

		if (a == b)
			continue;

		pair < int, int > aIndex = findIndex(a);
		pair < int, int > bIndex = findIndex(b);
		if (aIndex.first == bIndex.first)
			continue;

		if (strcmp(command.data(), "move") == 0)
		{
			if (strcmp(action.data(), "onto") == 0)
				moveOnto(a, b, aIndex, bIndex);
			else
				moveOver(a, b, aIndex, bIndex);

		}
		else if (strcmp(action.data(), "onto") == 0)
			pileOnto(a, b, aIndex, bIndex);
		else
			pileOver(a, b, aIndex, bIndex);
	}

	print();

	return 0;
}

自己的一直WA的代码，虽然自己的测试用例全都正确orz,如果大神们能给一个错误的测试数据或指出哪里错了，感激不尽QAQ：

#include 
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
#include
        
        
          using namespace std; int main() { stack 
         
           blocks[25]; int i,j,k,n,n1,n2,temp[30],ok=0,ok3=0; scanf("%d",&n); for(i=0; i<=n-1; i++) blocks[i].push(i); char fir[5],sec[5]; while(scanf("%s",fir)!=EOF) { if(strcmp(fir,"quit")==0) break; else { scanf("%d%s%d",&n1,sec,&n2); if(strcmp(fir,"move")==0&&strcmp(sec,"onto")==0) { for(j=0,i=0; j<=n-1; j++) { i=0,ok3=0; while(!blocks[j].empty()) { if(blocks[j].top()!=n1) { temp[i++]=blocks[j].top(); blocks[j].pop(); } else { int temp2[30],m=0; for(k=0; k<=n-1; k++) { if(k==j) continue; while(!blocks[k].empty()) { if(blocks[k].top()!=n2) { temp2[m++]=blocks[k].top(); blocks[k].pop(); } else { ok3=1; while(m--) { blocks[temp2[m]].push(temp2[m]); } m=0; ok=1; while(i--) { blocks[temp[i]].push(temp[i]); } i=0; break; } } if(ok==1) break; while(m--) { blocks[k].push(temp2[m]); } m=0; } } if(ok==1||ok3==0) break; } if(ok==1) break; while(i--) { blocks[j].push(temp[i]); } i=0; } if(ok==1) { blocks[k].push(blocks[j].top()); blocks[j].pop(); } ok=0; } else if(strcmp(fir,"move")==0&&strcmp(sec,"over")==0) { for(j=0,i=0; j<=n-1; j++) { i=0,ok3=0; while(!blocks[j].empty()) { if(blocks[j].top()!=n1) { temp[i++]=blocks[j].top(); blocks[j].pop(); } else { int temp2[30],m=0; for(k=0; k<=n-1; k++) { if(k==j) continue; while(!blocks[k].empty()) { if(blocks[k].top()!=n2) { temp2[m++]=blocks[k].top(); blocks[k].pop(); } else { ok3=1; while(i--) { blocks[temp[i]].push(temp[i]); } i=0; ok=1; break; } } while(m--) { blocks[k].push(temp2[m]); } m=0; if(ok==1) break; } if(ok==1||ok3==0) break; } } if(ok==1) break; while(i--) { blocks[j].push(temp[i]); } i=0; } if(ok==1) { blocks[k].push(blocks[j].top()); blocks[j].pop(); } ok=0; } else if(strcmp(fir,"pile")==0&&strcmp(sec,"onto")==0) { for(j=0,i=0; j<=n-1; j++) { i=0,ok3=0; while(!blocks[j].empty()) { ok3=0; if(blocks[j].top()!=n1) { temp[i++]=blocks[j].top(); blocks[j].pop(); ok3=1; } else { temp[i++]=blocks[j].top(); blocks[j].pop(); int temp2[30],m=0; for(k=0; k<=n-1; k++) { m=0; if(k==j) continue; while(!blocks[k].empty()) { if(blocks[k].top()!=n2) { temp2[m++]=blocks[k].top(); blocks[k].pop(); } else { ok3=1; while(m--) { blocks[temp2[m]].push(temp2[m]); } m=0; ok=1; break; } } if(ok==1) break; while(m--) { blocks[k].push(temp2[m]); } m=0; } } if(ok==1||ok3==0) break; } int r=i; if(ok==1) break; while(r--) { blocks[j].push(temp[r]); } r=0; } if(ok==1) { while(i--) { blocks[k].push(temp[i]); } } i=0; ok=0; } else if(strcmp(fir,"pile")==0&&strcmp(sec,"over")==0) { for(j=0,i=0; j<=n-1; j++) { i=0,ok3=0; while(!blocks[j].empty()) { ok3=0; if(blocks[j].top()!=n1) { temp[i++]=blocks[j].top(); blocks[j].pop(); ok3=1; } else { temp[i++]=blocks[j].top(); blocks[j].pop(); int temp2[30],m=0; for(k=0; k<=n-1; k++) { m=0; if(k==j) continue; while(!blocks[k].empty()) { if(blocks[k].top()!=n2) { temp2[m++]=blocks[k].top(); blocks[k].pop(); } else { ok3=1; ok=1; break; } } while(m--) { blocks[k].push(temp2[m]); } m=0; if(ok==1) break; } } if(ok==1||ok3==0) break; } if(ok==1) break; while(i--) { blocks[j].push(temp[i]); } i=0; } if(ok==1) { while(i--) blocks[k].push(temp[i]); } i=0; ok=0; } } } int ans[30]; for(i=0; i<=n-1; i++) { cout< 
          <<":"; if(blocks[i].size()>0) cout<<" "; j=0; while(!blocks[i].empty()) { ans[j++]=blocks[i].top(); blocks[i].pop(); } while(j--) { cout< 
           
             <<" "; } cout<