Submission #844841
Source Code Expand
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int INF = 1<<29; const double EPS = 1e-8; typedef vector<int> vec; typedef pair<int,int> P; typedef long long ll; int main(){ string S; cin >> S; vector<int> count(4, 0); for(int i=0;i<S.size();i++){ switch (S[i]) { case 'N': count[0]++; break; case 'S': count[1]++; break; case 'W': count[2]++; break; case 'E': count[3]++; break; } } bool ok = true; if ((count[0] == 0 && count[1] > 0) || (count[0] > 0 && count[1] == 0)){ ok = false; } if ((count[2] == 0 && count[3] > 0) || (count[2] > 0 && count[3] == 0)){ ok = false; } if(ok) cout << "Yes" << endl; else cout << "No" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | zaburo |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 968 Byte |
Status | AC |
Exec Time | 5 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 | 5 ms | 256 KB |
05.txt | AC | 4 ms | 256 KB |
06.txt | AC | 4 ms | 256 KB |
07.txt | AC | 4 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 | 4 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 |