Sail

题目：

N - Sail

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

The polar bears are going fishing. They plan to sail from (s_x, s_y) to (e_x, e_y). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or north. Assume the boat is currently at (x, y).

• If the wind blows to the east, the boat will move to (x + 1, y).
• If the wind blows to the south, the boat will move to (x, y - 1).
• If the wind blows to the west, the boat will move to (x - 1, y).
• If the wind blows to the north, the boat will move to (x, y + 1).

Alternatively, they can hold the boat by the anchor. In this case, the boat stays at (x, y). Given the wind direction for t seconds, what is the earliest time they sail to (e_x, e_y)?

Input

The first line contains five integers t, s_x, s_y, e_x, e_y(1 ≤ t ≤ 10⁵,  - 10⁹ ≤ s_x, s_y, e_x, e_y ≤ 10⁹). The starting location and the ending location will be different.

The second line contains t characters, the i-th character is the wind blowing direction at the i-th second. It will be one of the four possibilities: "E" (east), "S" (south), "W" (west) and "N" (north).

Output

If they can reach (e_x, e_y) within t seconds, print the earliest time they can achieve it. Otherwise, print "-1" (without quotes).

Sample Input

Input

5 0 0 1 1
SESNW

Output

4

Input

10 5 3 3 6
NENSWESNEE

Output

-1

代码：

#include <stdio.h>
#include <string.h>
#define MAX 100010
char str[MAX];

int main()
{
	int t, sx, sy, ex, ey, e, s, w, n, i, tag, nx, ny;

	while(~scanf("%d%d%d%d%d", &t, &sx, &sy, &ex, &ey))
	{
		getchar();
		tag = e = w = s = n = 0;
		memset(str, 0, sizeof(str));
		gets(str);
		nx = sx - ex;
		ny = sy - ey;

		for(i = 0; i < t; i++)
		{
			switch(str[i])
			{
			case 'E': e++; break;
			case 'W': w++; break;
			case 'S': s++; break;
			case 'N': n++; break;
			}
		}

		if( ((sx < ex) && (sx + e < ex)) || ((sx > ex) && (sx - w > ex)) || 
			((sy < ey) && (sy + n < ey)) || ((sy > ey) && (sy - s > ey)) ) 
		{
			puts("-1");
			continue;
		}

		if((sx == ex) || (sy == ey)) tag++;
		for(i = 0; i < t; i++)
		{
			if(2 == tag) break;
			if((sx < ex) && e) { if('E' == str[i]) {nx++; if(0 == nx) tag++; continue;} }
			if((sx > ex) && w) { if('W' == str[i]) {nx--; if(0 == nx) tag++; continue;} }
			if((sy < ey) && n) { if('N' == str[i]) {ny++; if(0 == ny) tag++; continue;} }
			if((sy > ey) && s) { if('S' == str[i]) {ny--; if(0 == ny) tag++; continue;} }
		}
		if(2 == tag) printf("%d\n", i);
	}

	return 0;
}

总结;

这是一道水题。但是我却wa了好几次。。。，想了一下，wa是因为之前有些东西没有考虑到，比如，sx==ex或是sy==ey，还有一点，就是在计算最短时间时，我用来计数的是原有的s、n、e、x，而不是所需的次数nx、ny,这个应该是因为有点逻辑混乱了。继续加油！！！