hdu 笔试2012-02贪吃蛇

//2012-02贪吃蛇
#include <iostream>
#include <string>
#include <deque>

using namespace std;

bool g[51][51];
deque<pair<int, int>> q;

int main()
{
    int n;
    
    while (cin >> n, n)
    {
        memset(g, 0, sizeof g);
        for (int i = 11; i <= 30; i++)
        {
            g[25][i] = 1;
            q.push_back({ 25,i });
        }
        getchar();
        string s;
        getline(cin, s);
        
        for (int i = 0; i <= s.size(); i++)
        {
            if (i == s.size())
            {
                cout << "The worm successfully made all " << i  << " moves";
                break;
            }
            int x = q.back().first;
            int y = q.back().second;  //(x,y)存储蛇头位置
            if (s[i] == 'N')
            {
                if (--x > 0 && !g[x][y])
                {
                    g[x][y] = 1;
                    q.push_back({ x - 1,y });
                    q.pop_front();
                }
                else
                {
                    if (g[x][y])
                        cout << "The worm run into itself on move " << i-1 << endl;
                    else
                        cout << "The worm ran off the board on move " << i-1 << endl;
                    break;
                }
                continue;
            }
            if (s[i] == 'S')
            {
                if (++x <= 50 && !g[x][y])
                {
                    g[x][y] = 1;
                    q.push_back({ x + 1,y });
                    q.pop_front();
                }
                else
                {
                    if (g[x][y])
                        cout << "The worm run into itself on move " << i-1 << endl;
                    else
                        cout << "The worm ran off the board on move " << i-1 << endl;
                    break;
                }
                continue;
            }
            if (s[i] == 'W')
            {
                if (--y > 0 && !g[x][y])
                {
                    g[x][y] = 1;
                    q.push_back({ x ,y - 1 });
                    q.pop_front();
                }
                else
                {
                    if (g[x][y])
                        cout << "The worm run into itself on move " << i-1 << endl;
                    else
                        cout << "The worm ran off the board on move " << i-1 << endl;
                    break;
                
                }
                continue;
            }
                
            if (s[i] == 'E')
            {
                if (++y <= 50 && !g[x][y])
                {
                    g[x][y] = 1;
                    q.push_back({ x ,y + 1 });
                    q.pop_front();
                }
                else
                {
                    if (g[x][y])
                        cout << "The worm run into itself on move " << i-1 << endl;
                    else
                        cout << "The worm ran off the board on move " << i-1 << endl;
                    break;
                }
                continue;
            }
        }
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值