Submission #844419
Source Code Expand
#include <vector> #include <iostream> #include <algorithm> #include <string> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); string s; cin >> s; int n = s.length(); int has[2]; has[0] = has[1] = 0; for (int i = 0; i < n; ++i) { if (s[i] == 'N') { has[0] += 1; } else if (s[i] == 'S') { has[0] += 2; } else if (s[i] == 'W') { has[1] += 1; } else { has[1] += 2; } } if (has[0] == 1 || has[0] == 2 || has[1] == 1 || has[1] == 2) { cout << "No" << endl; } else { cout << "Yes" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | bidzilya |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 733 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 4 ms | 256 KB |
04.txt | WA | 4 ms | 256 KB |
05.txt | WA | 4 ms | 256 KB |
06.txt | WA | 4 ms | 256 KB |
07.txt | WA | 4 ms | 256 KB |
08.txt | WA | 5 ms | 256 KB |
09.txt | WA | 4 ms | 256 KB |
10.txt | WA | 4 ms | 256 KB |
11.txt | AC | 4 ms | 256 KB |
13.txt | WA | 4 ms | 256 KB |
15.txt | WA | 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 |