Submission #845422
Source Code Expand
#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define Pi pair<int,int>
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1,0,-1 };
int dy[] = { 1, 0,-1,0 };
int dx8[] = { -1,-1,-1,0,0,1,1,1 };
int dy8[] = { -1,0,1,-1,1,-1,0,1 };
unsigned long long sttoi(std::string str) {
unsigned long long ret;
std::stringstream ss; ss << str;
ss >> ret;
return ret;
}
ull gcd(ull a, ull b) {
if (b > a)swap(a, b);
if (b == 0) return a;
return gcd(b, a%b);
}
int comb(int n, int k) {
int ans = 1;
for (int i = 0; i < min(k, n - k); i++) {
ans *= n - i;
ans /= i + 1;
}
return ans;
}
ll mod_pow(ll n, ll p, ll mod) {
if (p == 0) return 1 % mod;
if (p < 2) {
return n % mod;
}
else {
ll d = 2, value = (n%mod)*(n%mod) % mod;
while (d * 2 < p) { d *= 2; value *= value; value %= mod; }
value %= mod;
return ((value%mod) * (mod_pow(n, p - d, mod) % mod)) % mod;
}
}
bool isPrime(int n) {
if (n <= 1)return false;
if (n == 2)return true;
if (n % 2 == 0)return false;
for (int i = 3; i*i <= n; i += 2) {
if (n%i == 0)return false;
}
return true;
}
void solve() {
string st;
cin >> st;
bool e = 0, w = 0, n = 0, s = 0;
rep(i, st.length()) {
switch (st[i]) {
case 'S':s = 1; break;
case 'E':e = 1; break;
case 'N':n = 1; break;
case 'W':w = 1; break;
}
}
if (s==n && e==w) {
P("Yes");
}
else {
P("No");
}
}
int main() {
solve();
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Wanna go back home |
User |
pantacia1128 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1814 Byte |
Status |
AC |
Exec Time |
4 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 |
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 |