Submission #1159422

---

Source Code Expand

#define NDEBUG
NDEBUG


#include <algorithm>
#include <cassert>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <memory>
#include <random>

#define FOR(i, n) for (int i = 0; i < (n); ++i)


using namespace std;

/// caide keep
bool __hack = std::ios::sync_with_stdio(false);
/// caide keep
auto __hack1 = cin.tie(nullptr);


namespace template_util {


    constexpr int bytecount(uint64_t x) {
        return x ? 1 + bytecount(x >> 8) : 0;
    }

    /// caide keep
    template<int N>
    struct bytetype {

    };

    /// caide keep
    template<>
    struct bytetype<4> {

    };

    /// caide keep
    template<>
    struct bytetype<3> {

    };

    /// caide keep
    template<>
    struct bytetype<2> {

    };

    /// caide keep
    template<>
    struct bytetype<1> {

    };

    /// caide keep
    template<>
    struct bytetype<0> {

    };

    /// caide keep
    template<uint64_t N>
    struct minimal_uint : bytetype<bytecount(N)> {
    };
}


template<class T>
T next(istream& in) {
    T ret;
    in >> ret;
    return ret;
}


void solve(istream& in, ostream& out) {
    string s = next<string>(in);
    int delta1 = 0, delta2 = 0;
    FOR(i, s.length()) {
        if (s[i] == 'S') {
            delta1 |= 1;
        }
        if (s[i] == 'N') {
            delta1 |= 2;
        }
        if (s[i] == 'E') {
            delta2 |= 1;
        }
        if (s[i] == 'W') {
            delta2 |= 2;
        }
    }
    if (delta1 == 0) delta1 = 3;
    if (delta2 == 0) delta2 = 3;
    if (delta1 == 3 && delta2 == 3) {
        out << "Yes\n";
    } else {
        out << "No\n";
    }

}


int main() {
    solve(cin, cout);
    return 0;
}

Submission Info

Judge Result