Submission #4261001
Source Code Expand
#include <iostream> #include <algorithm> #include <cstdio> #include <cmath> #include <vector> #include <map> #include <set> #include <string> #include <stack> // s.top() #include <bitset> #include <queue> // s.front() using namespace std; typedef long long Int; typedef pair<Int,Int> P; #define print(x) cout<<(x)<<endl #define INF10 10000000000 #define INF5 100000 #define EPS 1e-10 #define MOD 1000000007 int n, w, s, e; int main() { string p; cin >> p; for (int i = 0; i < p.length(); i++) { if (p[i] == 'N')n=1; if (p[i] == 'W')w=1; if (p[i] == 'S')s=1; if (p[i] == 'E')e=1; } if (n==s&&w==e)print("Yes"); else print("No"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | aknorsh |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 703 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 |