Codeforces Round #180 (Div. 2)-B. Sail

原题链接
B. Sail
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
The polar bears are going fishing. They plan to sail from (sx, sy) to (ex, ey). 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 (ex, ey)?

Input
The first line contains five integers t, sx, sy, ex, ey (1 ≤ t ≤ 105,  - 109 ≤ sx, sy, ex, ey ≤ 109). 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 (ex, ey) within t seconds, print the earliest time they can achieve it. Otherwise, print “-1” (without quotes).

Examples
input
5 0 0 1 1
SESNW
output
4
input
10 5 3 3 6
NENSWESNEE
output
-1
Note
In the first sample, they can stay at seconds 1, 3, and move at seconds 2, 4.

In the second sample, they cannot sail to the destination.
思路：这个题很简单，就是统计一下这些方向一共有多少个就是了，只要超出就总是能够到达的

//http://codeforces.com/problemset/problem/298/B
#include <algorithm>
#include <iostream>
#include <utility>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;

typedef long long ll;
const int MOD = int(1e9) + 7;
//int MOD = 99990001;
const int INF = 0x3f3f3f3f;
const ll INFF = (~(0ULL)>>1);
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos(-1.0); //M_PI;
const int fx[] = {-1, 1, 0, 0};
const int fy[] = {0, 0, -1, 1};
const int maxn=100000 + 5;
int _fabs(int a,int b){
	return a>b ? a-b : b-a;
}
char s[maxn];
int main(){
    int n,sx,sy,ex,ey;
    cin >> n >> sx >> sy >> ex >> ey;
    scanf("%s",s);
    int len=strlen(s);
    if(ex-sx>=0 && ey-sy>=0){
    	int sume=0,sumn=0;
    	for(int i=0;i<len;i++){
    		if(s[i]=='E') sume++;
    		else if(s[i]=='N') sumn++;
    		if(sume>=ex-sx && sumn>=ey-sy){
    			cout << i+1 << endl;
    			goto END1;
    		}
    	}
    	cout << -1 << endl;
    	END1:;
    }
    else if(ex-sx<=0 && ey-sy>=0){
    	int sumw=0,sumn=0;
    	for(int i=0;i<len;i++){
    		if(s[i]=='W') sumw++;
    		else if(s[i]=='N') sumn++;
    		if(sumw>=sx-ex && sumn>=ey-sy){
    			cout << i+1 << endl;
    			goto END2;
    		}
    	}
    	cout << -1 << endl;
    	END2:;
    }
    else if(ex-sx<=0 && ey-sy<=0){
    	int sumw=0,sums=0;
    	for(int i=0;i<len;i++){
    		if(s[i]=='W') sumw++;
    		else if(s[i]=='S') sums++;
    		if(sumw>=sx-ex && sums>=sy-ey){
    			cout << i+1 << endl;
    			goto END3;
    		}
    	}
    	cout << -1 << endl;
    	END3:;
    }
    else{
    	int sume=0,sums=0;
    	for(int i=0;i<len;i++){
    		if(s[i]=='E') sume++;
    		else if(s[i]=='S') sums++;
    		if(sume>=ex-sx && sums>=sy-ey){
    			cout << i+1 << endl;
    			goto END4;
    		}
    	}
    	cout << -1 << endl;
    	END4:;
    }
    return 0;
}