UVa101 - The Blocks Problem

题目地址：点击打开链接

C++代码：

#include <iostream>
#include <string>
#include <stack>
using namespace std;
const int maxsize = 30;
int main()
{
	int n;
	cin>>n;
	stack<int> st[maxsize];
	int position[maxsize];
	int i;
	for(i=0;i<n;++i)
	{
		st[i].push(i);
		position[i]=i;
	}
	string s1,s2;
	int a,b;
	while(cin>>s1&&s1!="quit")
	{
		cin>>a>>s2>>b;
		if(position[a]!=position[b])
		{
			if(s1=="move")
			{
				if(s2=="onto")
				{
					while(st[position[a]].top()!=a)
					{
						int temp=st[position[a]].top();
						st[position[a]].pop();
						position[temp]=temp;
						st[temp].push(temp);
					}
					while(st[position[b]].top()!=b)
					{
						int temp=st[position[b]].top();
						st[position[b]].pop();
						position[temp]=temp;
						st[temp].push(temp);
					}
					st[position[a]].pop();
					position[a]=position[b];
					st[position[b]].push(a);
				}
				else
				{
					while(st[position[a]].top()!=a)
					{
						int temp=st[position[a]].top();
						st[position[a]].pop();
						position[temp]=temp;
						st[temp].push(temp);
					}
					st[position[a]].pop();
					position[a]=position[b];
					st[position[b]].push(a);
				}
			}
			else
			{
				if(s2=="onto")
				{
					while(st[position[b]].top()!=b)
					{
						int temp=st[position[b]].top();
						st[position[b]].pop();
						position[temp]=temp;
						st[temp].push(temp);
					}
					stack<int> sti;
					while(st[position[a]].top()!=a)
					{
						int temp=st[position[a]].top();
						st[position[a]].pop();
						position[temp]=position[b];
						sti.push(temp);
					}
					st[position[a]].pop();
					st[position[b]].push(a);
					position[a]=position[b];
					while(!sti.empty())
					{
						int temp=sti.top();
						sti.pop();
						st[position[b]].push(temp);
					}
				}
				else
				{
					stack<int> sti;
					while(st[position[a]].top()!=a)
					{
						int temp=st[position[a]].top();
						st[position[a]].pop();
						position[temp]=position[b];
						sti.push(temp);
					}
					st[position[a]].pop();
					st[position[b]].push(a);
					position[a]=position[b];
					while(!sti.empty())
					{
						int temp=sti.top();
						sti.pop();
						st[position[b]].push(temp);
					}
				}
			}
		}
	}
	for(i=0;i<n;++i)
	{
		cout<<i<<":";
		stack<int> sti;
		while(!st[i].empty())
		{
			int temp=st[i].top();
			st[i].pop();
			sti.push(temp);
		}
		while(!sti.empty())
		{
			cout<<" "<<sti.top();
			sti.pop();
		}
		cout<<endl;
	}
	return 0;
}