Submission #1688260
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- 2017/10/16 Problem: nagoya_19_01 / Link: ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
LL N;
LL ans = 0LL;
int dir[4];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string S;
cin >> S;
FOR(i, 0, SZ(S)) {
if (S[i] == 'N')dir[0]++;
if (S[i] == 'S')dir[1]++;
if (S[i] == 'W')dir[2]++;
if (S[i] == 'E')dir[3]++;
}
int f = 1;
FOR(i, 0, 2) {
if (dir[2 * i] > 0 && dir[2 * i + 1] == 0)f = 0;
if (dir[2 * i] == 0 && dir[2 * i + 1] > 0)f = 0;
}
cout << (f?"YES":"NO")<< "\n";
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Wanna go back home |
User |
Yang33 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1625 Byte |
Status |
WA |
Exec Time |
1 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 |
1 ms |
256 KB |
04.txt |
WA |
1 ms |
256 KB |
05.txt |
WA |
1 ms |
256 KB |
06.txt |
WA |
1 ms |
256 KB |
07.txt |
WA |
1 ms |
256 KB |
08.txt |
WA |
1 ms |
256 KB |
09.txt |
WA |
1 ms |
256 KB |
10.txt |
WA |
1 ms |
256 KB |
11.txt |
WA |
1 ms |
256 KB |
13.txt |
WA |
1 ms |
256 KB |
15.txt |
WA |
1 ms |
256 KB |
s1.txt |
WA |
1 ms |
256 KB |
s2.txt |
WA |
1 ms |
256 KB |
s3.txt |
WA |
1 ms |
256 KB |
s4.txt |
WA |
1 ms |
256 KB |