Submission #844582
Source Code Expand
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd second
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define Mx(a , b) ((a) > (b) ? (a) : (b))
#define Mn(a , b) ((a) < (b) ? (a) : (b))
const double EPS = 1e-10;
const int INF = 2147483647;
bool b[4];
char s[1010];
int main(){
scanf("%s" , s);
for(int i = 0 ; s[i] != 0 ; ++i){
if(s[i] == 'N'){
b[0] = 1;
} else if(s[i] == 'S'){
b[1] = 1;
} else if(s[i] == 'W'){
b[2] = 1;
} else {
b[3] = 1;
}
}
printf("%s\n" , !((b[0] ^ b[1]) || (b[2] ^ b[3])) ? "Yes" : "No");
return 0;
}
Submission Info
Submission Time
2016-08-21 21:04:58+0900
Task
A - Wanna go back home
User
PIandS
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
1004 Byte
Status
AC
Exec Time
2 ms
Memory
128 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:30:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s" , s);
^
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
2 ms
128 KB
04.txt
AC
2 ms
128 KB
05.txt
AC
2 ms
128 KB
06.txt
AC
2 ms
128 KB
07.txt
AC
2 ms
128 KB
08.txt
AC
2 ms
128 KB
09.txt
AC
2 ms
128 KB
10.txt
AC
2 ms
128 KB
11.txt
AC
2 ms
128 KB
13.txt
AC
2 ms
128 KB
15.txt
AC
2 ms
128 KB
s1.txt
AC
2 ms
128 KB
s2.txt
AC
2 ms
128 KB
s3.txt
AC
2 ms
128 KB
s4.txt
AC
2 ms
128 KB