The Worm Turns (模拟)

The Worm Turns

Time Limit:1000 ms | Memory Limit:32768 KB
Submit:10 (9 users) | Accepted:8 (8 users)

Description

Worm is an old computer game. There are many versions, but all involve maneuvering a "worm" around
the screen, trying to avoid running the worm into itself or an obstacle.
We'll simulate a very simplified version here. The game will be played on a 50*50 board, numbered so
that the square at the upper left is numbered (1, 1). The worm is initially a string of 20 connected squares.
Connected squares are adjacent horizontally or vertically. The worm starts stretched out horizontally in
positions (25, 11) through (25, 30), with the head of the worm at (25, 30). The worm can move either
East (E), West (W), North (N) or South (S), but will never move back on itself. So, in the initial position,
a W move is not possible. Thus the only two squares occupied by the worm that change in any move are
its head and tail. Note that the head of the worm can move to the square just vacated by the worm's
tail.
You will be given a series of moves and will simulate the moves until either the worm runs into itself, the
worm runs off the board, or the worm successfully negotiates its list of moves. In the first two cases you
should ignore the remaining moves in the list.

Input

There will be multiple problems instances. The input for each problem instance will be on two lines. The
first line is an integer n (< 100) indicating the number of moves to follow. (A value of n = 0 indicates
end of input.) The next line contains n characters (either E, W, N or S), with no spaces separating the
letters, indicating the sequence of moves.

Output

Generate one line of output for each problem instance. The output line should be one of the follow three:
* The worm ran into itself on move m.
* The worm ran off the board on move m.
* The worm successfully made all m moves.
Where m is for you to determine and the first move is move 1.

Sample Input

18

NWWWWWWWWWWSESSSWS

20

SSSWWNENNNNNWWWWSSSS

30

EEEEEEEEEEEEEEEEEEEEEEEEEEEEEE

13

SWWWWWWWWWNEE

0

Sample Output

The worm successfully made all 18 moves.

The worm ran into itself on move 9.

The worm ran off the board on move 21.

The worm successfully made all 13 moves.



就是贪吃蛇游戏，有一些小的特殊情况没考虑好，做了一些时间。



#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <queue>
#include <map>
#include <list>
#include <set>
#include <vector>
using namespace std;

struct dt
{
	int a, b;
};
bool g[55][55];
char str[102];
inline bool isin(int x, int y)
{
	return x > 0 && y > 0 && x <= 50 && y <= 50;
}
int main()
{
	int n;
	while (scanf("%d", &n), n)
	{
		scanf("%s", str);
		memset(g, 0, sizeof(g));

		deque<dt> de;
		for (int i=30; i >= 11; i--)
		{
			g[25][i] = true;
			dt tmp = {25, i};
			de.push_back(tmp);
		}
		dt s = {25, 30};
		//dt e = {25, 11};

		int step = 0;
		bool isout = false;
		bool self = false;

		for (int i=0; str[i] != 0 && !isout && !self; i++)
		{
			switch (str[i])
			{
				case 'N':
					if (isin(s.a-1, s.b))
					{
						dt tmp = {s.a-1, s.b};
						if (tmp.a == de[1].a && tmp.b == de[1].b)
							break;
						step++;
						if (g[tmp.a][tmp.b] && !(tmp.a == de.back().a && tmp.b == de.back().b))
						{
							self = true;
							break;
						}
						de.push_front(tmp);
						g[de.back().a][de.back().b] = false;
						de.pop_back();
						g[tmp.a][tmp.b] = true;
						s = tmp;
					}
					else
					{
						isout = true;
						step++;
					}
					break;
				case 'S':
					if (isin(s.a+1, s.b))
					{
						dt tmp = {s.a+1, s.b};
						if (tmp.a == de[1].a && tmp.b == de[1].b)
							break;
						step++;
						if (g[tmp.a][tmp.b] && !(tmp.a == de.back().a && tmp.b == de.back().b))
						{
							self = true;
							break;
						}
						de.push_front(tmp);
						g[de.back().a][de.back().b] = false;
						de.pop_back();
						g[tmp.a][tmp.b] = true;
						s = tmp;
					}
					else
					{
						isout = true;
						step++;
					}
					break;
				case 'E':
					if (isin(s.a, s.b+1))
					{
						dt tmp = {s.a, s.b+1};
						if (tmp.a == de[1].a && tmp.b == de[1].b)
							break;
						step++;
						if (g[tmp.a][tmp.b] && !(tmp.a == de.back().a && tmp.b == de.back().b))
						{
							self = true;
							break;
						}
						de.push_front(tmp);
						g[de.back().a][de.back().b] = false;
						de.pop_back();
						g[tmp.a][tmp.b] = true;
						s = tmp;
					}
					else
					{
						isout = true;
						step++;
					}
					break;
				case 'W':
					if (isin(s.a, s.b-1))
					{
						dt tmp = {s.a, s.b-1};
						if (tmp.a == de[1].a && tmp.b == de[1].b)
							break;
						step++;
						if (g[tmp.a][tmp.b] && !(tmp.a == de.back().a && tmp.b == de.back().b))
						{
							self = true;
							break;
						}
						de.push_front(tmp);
						g[de.back().a][de.back().b] = false;
						de.pop_back();
						g[tmp.a][tmp.b] = true;
						s = tmp;
					}
					else
					{
						isout = true;
						step++;
					}
					break;
			}
		}
					
		//cout << step << isout << self<<endl;
		if (isout)
			printf("The worm ran off the board on move %d./n", step);
		else if (self)
			printf("The worm ran into itself on move %d./n", step);
		else
			printf("The worm successfully made all %d moves./n", step);




	}
	return 0;
}