Submission #844410

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <iomanip>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <ctime>
#include <fstream>
#include <cmath>
#include <unordered_map>

using namespace std;

#ifndef LOCAL
#define cerr if(0)cerr
#endif

#define pb push_back
#define mp make_pair
#define F first
#define S second
#define RT fprintf(stderr, "\nTIME = %lf\n", 1.0 * clock()/CLOCKS_PER_SEC);

typedef long long ll;
typedef long double ld;

const int INFint = 2e9;
const ll INF = 2e18;
const int MOD = 1e9 + 7;

#define FILE "palindrome"


int main() {
    ios_base::sync_with_stdio(0);
#ifdef LOCAL
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#else
    //    freopen(FILE".in", "r", stdin); freopen(FILE".out", "w", stdout);
    //    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
    string s;
    cin >> s;
    int x = 0, y = 0;
    for (auto c : s) {
        if (c == 'N') x--;
        if (c == 'S') x++;
        if (c == 'W') y++;
        if (c == 'E') y--;
        if (x == 0 && y == 0) {
            cout << "Yes\n";
            return 0;
        }

    }
    cout << "No\n";

    RT;
    return 0;
}

Submission Info

Judge Result