UVA-227 Puzzle(傻屌之王)

#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#include <string.h>
#include <stack>
#include <unordered_map>
#include <math.h>
#include <iomanip>

using namespace std;

int main()
{
    char puzzleGraph[5][7];
    string inputLine;
    int cnt = 1;
    while(1)
    {
        int flag = 0,flag2 = 1;
        int cur_x,cur_y;

        for(int i = 0; i < 5; i ++)
        {
            if(flag2 && cnt!=1)
            {
                getline(cin, inputLine);
                i = -1;
                flag2 = 0;
                continue;
            }
            getline(cin, inputLine);
            if(i==0 && inputLine[0] == 'Z')
            {
                flag = 1;
                break;
            }
            for(int j = 0; j < 5; j ++)
            {
                if(inputLine[j] == ' ')
                {
                    cur_x = i;
                    cur_y = j;
                    //    cout << "OK" << endl;
                }
                if(inputLine.size()==4 && j==3)
                {
                    puzzleGraph[i][j] = inputLine[j++];
                //    puzzleGraph[i][++j] = ' ';
                    cur_x = i;
                    cur_y = 4;
                    continue;
                }
                puzzleGraph[i][j] = inputLine[j];
            }
        }

        if(flag)
            break;

        string actions;
        cin >> actions;
        while(actions[actions.size()-1] != '0')
        {
            string tmp;
            cin >> tmp;
            actions += tmp;
        }

        for(int i = 0; actions[i]!='0'; i ++)
        {
            //    cout << cur_x << " " << cur_y << endl;
            if(actions[i]=='A')
            {
                if(cur_x-1>=0)
                {
                    puzzleGraph[cur_x][cur_y] = puzzleGraph[cur_x-1][cur_y];
                    cur_x --;
                }
                else
                {
                    flag = 3;
                    break;
                }
            }
            else if(actions[i]=='B')
            {
                if(cur_x+1<5)
                {
                    puzzleGraph[cur_x][cur_y] = puzzleGraph[cur_x+1][cur_y];
                    cur_x ++;
                }
                else
                {
                    flag = 3;
                    break;
                }
            }
            else if(actions[i]=='R')
            {
                if(cur_y+1<5)
                {
                    puzzleGraph[cur_x][cur_y] = puzzleGraph[cur_x][cur_y+1];
                    cur_y ++;
                }
                else
                {
                    flag = 3;
                    break;
                }
            }
            else if(actions[i]=='L')
            {
                if(cur_y-1>=0)
                {
                    puzzleGraph[cur_x][cur_y] = puzzleGraph[cur_x][cur_y-1];
                    cur_y --;
                }
                else
                {
                    flag = 3;
                    break;
                }
            }
        }
        if(cnt!=1)
            cout << endl;
        cout << "Puzzle #" << cnt ++ << ":" << endl;
        if(flag == 3)
        {
            cout << "This puzzle has no final configuration." << endl;
            continue;
        }

        puzzleGraph[cur_x][cur_y] = ' ';

        for(int i = 0; i < 5; i ++)
        {
            for(int j = 0; j < 4; j ++)
            {
                cout << puzzleGraph[i][j] << " ";
            }
            cout << puzzleGraph[i][4] << endl;
        }
    }
    return 0;
}