Submission #11561234
Source Code Expand
#include <bits/stdc++.h> #pragma GCC optimize("Ofast") #define REP(i, n) for (int i = 0; i < n; i++) #define FOR(i, m, n) for (int i = m; i < n; i++) #define ALL(v) v.begin(), v.end() using ll = long long; using ull = unsigned long long; using namespace std; int main() { string S; bool n = false, w = false, s = false, e = false; cin >> S; REP(i, S.size()) { if (S[i] == 'N') n = true; if (S[i] == 'W') w = true; if (S[i] == 'S') s = true; if (S[i] == 'E') e = true; } if (n == true && s == false) { puts("No"); } else if (n == false && s == true) { puts("No"); } else if (w == true && e == false) { puts("No"); } else if (w == false && e == true) { puts("No"); } else { puts("Yes"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | rereyu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 762 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 13.txt, 15.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
15.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |