Robot Motion (模拟题)

Robot Motion
Time Limit: 1000MS Memory Limit: 10000K
   

Description


A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are 

N north (up the page) 
S south (down the page) 
E east (to the right on the page) 
W west (to the left on the page) 

For example, suppose the robot starts on the north (top) side of Grid 1 and starts south (down). The path the robot follows is shown. The robot goes through 10 instructions in the grid before leaving the grid. 

Compare what happens in Grid 2: the robot goes through 3 instructions only once, and then starts a loop through 8 instructions, and never exits. 

You are to write a program that determines how long it takes a robot to get out of the grid or how the robot loops around. 

Input

There will be one or more grids for robots to navigate. The data for each is in the following form. On the first line are three integers separated by blanks: the number of rows in the grid, the number of columns in the grid, and the number of the column in which the robot enters from the north. The possible entry columns are numbered starting with one at the left. Then come the rows of the direction instructions. Each grid will have at least one and at most 10 rows and columns of instructions. The lines of instructions contain only the characters N, S, E, or W with no blanks. The end of input is indicated by a row containing 0 0 0.

Output

For each grid in the input there is one line of output. Either the robot follows a certain number of instructions and exits the grid on any one the four sides or else the robot follows the instructions on a certain number of locations once, and then the instructions on some number of locations repeatedly. The sample input below corresponds to the two grids above and illustrates the two forms of output. The word "step" is always immediately followed by "(s)" whether or not the number before it is 1.

Sample Input

3 6 5
NEESWE
WWWESS
SNWWWW
4 5 1
SESWE
EESNW
NWEEN
EWSEN
0 0 0

Sample Output

10 step(s) to exit
3 step(s) before a loop of 8 step(s)

Source

#include <iostream>
#include <string>
#include <string>
#include <cstdio>

using namespace std;

int main()
{
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    int n,m,first;
    while(cin>>n>>m>>first)
    {
        if(n==0&&m==0&&first==0)
            break;
        char grid[10000][10]={'\0'};
        int k,i;
        int flag=0,step=0,xhstep=0;
        int a[10000][10]={0};       //对地图每个点进行标记,初始为0,如果该点走过一次,将其标记为1,如果是循环路线的第一步,将其标记为2

        for(i=0;i<n;i++)            //将地图读入
            for(k=0;k<m;k++)
            cin>>grid[i][k];

        k=0;                        //第一行
        int next=first-1;           //第一步的位置
        while(a[k][next]==0)        //如果下一步未标记,则需要走这一步,并进行标记
        {
            a[k][next]=1;           //这一步走过,标记为1
            step++;                 //步数+1
            switch(grid[k][next])   //这一步对下一步的指示,有四种可能
            {
                case 'N':{k--;};break;
                case 'S':{k++;};break;
                case 'W':{next--;};break;
                case 'E':{next++;};break;
            }
            if(k<0||k>n-1)          //如果下一步是边界,跳出
            {
                flag=1;             //说明没有循环路线
                break;
            }
            if(next<0||next>m-1)    //如果下一步是边界,跳出
            {
                flag=1;             //说明没有循环路线
                break;
            }
        }
        a[k][next]=2;              //如果有循环路线,这个位置一定是循环路线的第一步.如果没有,虽然不存在这个位置,但对结果无影响

        if(flag==1)                //无循环路线时,输出走的步数即可
        {
            cout<<step<<" step(s) to exit"<<endl;
            continue;
        }

        switch(grid[k][next])      //针对有有循环路线的操作,这是求出循环路线的第二步
        {
            case 'N':{k--;};break;
            case 'S':{k++;};break;
            case 'W':{next--;};break;
            case 'E':{next++;};break;
        }
        xhstep++;                  //循环步数+1
        while(a[k][next]==1)       //走循环路线,直到又走到循环路线的第一步
        {
            a[k][next]=2;
            xhstep++;
            switch(grid[k][next])
            {
                case 'N':{k--;};break;
                case 'S':{k++;};break;
                case 'W':{next--;};break;
                case 'E':{next++;};break;
            }
        }
        step-=xhstep;              //总路线分两部分,一部分是不循环的,一部分是循环的,两部分大小相加正好是总路线的长度
        cout<<step<<" step(s) before a loop of "<<xhstep<<" step(s)"<<endl;
    }
    return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值