Submission #1187762
Source Code Expand
#include<cstdio> #include <iostream> #include<algorithm> #include<string> #include<cstring> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<cstdlib> #include<list> #include<set> #include<numeric> #define MOD 1000000007 using namespace std; typedef long long ll; typedef pair<int, int> P; char s[1010]; int main() { cin >> s; int flagN = 0, flagS = 0, flagW = 0, flagE = 0; for (int i = 0; s[i] != '\0'; i++) { if (s[i] == 'N')flagN = 1; else if (s[i] == 'S')flagS = 1; else if (s[i] == 'E')flagE = 1; else if (s[i] == 'W')flagW = 1; } if (flagN == flagS && flagW == flagE) cout << "Yes" << endl; else cout << "No" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 757 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 |