Submission #844423
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REPU(i, a, b) for (int i = (a); i < (b); ++i) #define REPD(i, a, b) for (int i = (a); i > (b); --i) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) #define DEBUG(x) cerr << #x << " = " << x << endl typedef long long ll; const int MOD = 1000000007; template<class T, class U> inline T tmin(T a, U b) { return (a < b) ? a : b; } template<class T, class U> inline T tmax(T a, U b) { return (a > b) ? a : b; } template<class T, class U> inline void amax(T &a, U b) { if (b > a) a = b; } template<class T, class U> inline void amin(T &a, U b) { if (b < a) a = b; } template<class T> inline T tabs(T a) { return (a > 0) ? a : -a; } template<class T> T gcd(T a, T b) { while (b != 0) { T c = a; a = b; b = c % b; } return a; } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); string s; cin >> s; bool ok = true; vector<int> f(4, 0); REPU(i, 0, s.size()) { if (s[i] == 'S') f[0] = 1; if (s[i] == 'N') f[1] = 1; if (s[i] == 'W') f[2] = 1; if (s[i] == 'E') f[3] = 1; } if (f[0] != f[1] || f[2] != f[3]) ok = false; puts(ok ? "Yes" : "No"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | rantd |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1259 Byte |
Status | AC |
Exec Time | 6 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 | 4 ms | 256 KB |
04.txt | AC | 4 ms | 256 KB |
05.txt | AC | 4 ms | 256 KB |
06.txt | AC | 4 ms | 256 KB |
07.txt | AC | 6 ms | 256 KB |
08.txt | AC | 4 ms | 256 KB |
09.txt | AC | 4 ms | 256 KB |
10.txt | AC | 4 ms | 256 KB |
11.txt | AC | 4 ms | 256 KB |
13.txt | AC | 6 ms | 256 KB |
15.txt | AC | 4 ms | 256 KB |
s1.txt | AC | 4 ms | 256 KB |
s2.txt | AC | 4 ms | 256 KB |
s3.txt | AC | 4 ms | 256 KB |
s4.txt | AC | 4 ms | 256 KB |