Submission #844414

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    string s;
    cin >> s;
    map<char,bool> M;
    REP(i,s.size()){
        M[s[i]] = 1;
    }
    if ((M['E']^M['W']) == 0 && (M['S']^M['N']) == 0)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result