题意:
解法:
N和S一定要同时存在,W和E一定要同时存在,
如果不同时存在则No,否则Yes.
code:
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=2e3+5;
char s[maxm];
int n;
signed main(){
ios::sync_with_stdio(0);
cin>>(s+1);
n=strlen(s+1);
map<char,int>mp;
for(int i=1;i<=n;i++){
mp[s[i]]=1;
}
string a="NW";
string b="SE";
for(int i=0;i<2;i++){
if(mp[a[i]]&&!mp[b[i]]){
cout<<"No"<<endl;
return 0;
}
if(mp[b[i]]&&!mp[a[i]]){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
}