Sail CodeForces

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).

Example
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.

#include<cstdio>#include<iostream>#include<vector>#include<set>#include<queue>#include<cmath>#include<string>using namespace std;int main(){    int t,sx,sy,ex,ey;    cin>>t>>sx>>sy>>ex>>ey;    long long x=sx,y=sy;    string str;    cin>>str;    if(x==ex&&y==ey)    {        cout<<0;        return 0;    }    for(int i=0;i<str.size();i++)    {        if(str[i]=='E'&&ex-x>0)x++;        if(str[i]=='S'&&ey-y<0)y--;        if(str[i]=='W'&&ex-x<0)x--;        if(str[i]=='N'&&ey-y>0)y++;        if(x==ex&&y==ey)        {            cout<<i+1;            return 0;        }    }    cout<<-1;    return 0;}