T143990 路径相交检测

#include<bits/stdc++.h>
using namespace std;
const int N = 1e4+4 ;
//const int M = 1e8+5;
int book[N][N];
int main()
{
	string str;
	cin>>str;
	int len=str.size();
	int x=N/2,y=N/2;
	book[x][y]=1;
	for(int i=0;i<len;i++){
		if(str[i]=='N'){
			x++;
			if(book[x][y]==1) {
				printf("Yes");
				return 0;
			}
			book[x][y]=1;
		}
		else if(str[i]=='S'){
			x--;
			if(book[x][y]==1) {
				printf("Yes");
				return 0;
			}
			book[x][y]=1;
		}
		else if(str[i]=='E'){
			y++;
			if(book[x][y]==1) {
				printf("Yes");
				return 0;
			}
			book[x][y]=1;
		}
		else if(str[i]=='W'){
			y--;
			if(book[x][y]==1) {
				printf("Yes");
				return 0;
			}
			book[x][y]=1;
		}
	}
	printf("No");
	return 0;
}