zoj 2954 Hanoi Tower

 题目描述：

Hanoi Tower

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

You all must know the puzzle named "The Towers of Hanoi". The puzzle has three pegs (peg 1, peg 2 and peg 3) and N disks of different radii. Initially all disks are located on the first peg, ordered by their radii - the largest at the bottom, the smallest at the top. In each turn you may take the topmost disc from any peg and move it to another peg, the only rule says that you may not place the disc atop any smaller disk. The problem is to move all disks to the last peg (peg 3). I use two different integers a (1 <= a <= 3) and b (1 <= b <= 3) to indicate a move. It means to move the topmost disk of peg a to the top of peg b. A move is valid if and only if there is at least one disk on peg a and the topmost disk of peg a can be moved on the peg b without breaking the former rule.

Give you some moves of a game, can you give out the result of the game?

Input

Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 55) which is the number of test cases. And it will be followed by T consecutive test cases.

The first line of each test case is a single line containing 2 integers n (1 <= n <= 10) and m (1 <= m <= 12000) which is the number of disks and the number of the moves. Then m lines of moves follow.

Output

For each test case, output an integer in a single line according to the result of the moves.
Note:
(1) If there is an invalid move before all disks being on peg 3 and the invalid move is the p^-th move of this case (start from 1) , output the integer -p please and the moves after this move(if any) are ignored.
(2) If after the p^-th move all disks are on peg 3 without any invalid move, output the integer p please and the moves after this move (if any) are ignored.
(3) Otherwise output the integer 0 please.

Sample Input

 

3
2 3
1 2
1 3
2 3
2 3
1 2
1 3
3 2
2 3
1 3
1 2
3 2

 

Sample Output

 

3
-3
0

#include<iostream>
#include<algorithm>
#include<string.h>
#include<stack>
using namespace std;
stack<int> a[3];
int b[60];
int q=0;
int solve(int from,int to)
{
    if(a[from].empty())
    {//-1有错
        return -1; 
    }
    if(!a[to].empty())//a[to].top()有可能为空，要先进行判断
        if(a[from].top()>a[to].top())
            return -1; 
    a[to].push(a[from].top());
    a[from].pop();
    return 0;
}
void empty()
{
    int i;
    for(i=0;i<3;i++)
    {
        while(!a[i].empty())
            a[i].pop();
    }
}
int main()
{
    int T,n,m,i,j,from,to,get;
    while(cin>>T)
    {
        while(T--)
        {
            cin>>n>>m;
            for(i=n;i>0;i--)
                a[0].push(i);
            for(j=1;j<=m;j++)
            {
                cin>>from>>to;
                get=solve(from-1,to-1);
                if(get==-1)
                {
                    b[q++]=0-j;
                    while(j<m)//要等输入完成才能退出本次循环
                    {
                        j++;
                        cin>>from>>to;
                    }
                    cout<<b[q-1]<<endl;
                    break;
                }
                if(a[0].empty()&&a[1].empty()&&a[2].top()==1)
                //if(a[2].size()==n)
                {    
                    b[q++]=j;
                    while(j<m)
                    {
                        j++;
                        cin>>from>>to;
                    }
                    cout<<b[q-1]<<endl;
                    break;
                }else if(j==m)
                {    
                    b[q++]=0;
                    cout<<b[q-1]<<endl;
                }
            }    
            empty();//退出时应该把栈的内容清空
        }
    }
    return 0;
}