Submission #4240658
Source Code Expand
import sys stdin = sys.stdin sys.setrecursionlimit(10**8) def li(): return map(int, stdin.readline().split()) def li_(): return map(lambda x: int(x)-1, stdin.readline().split()) def lf(): return map(float, stdin.readline().split()) def ls(): return stdin.readline().split() def ns(): return stdin.readline().rstrip() def lc(): return list(ns()) def ni(): return int(stdin.readline()) def nf(): return float(stdin.readline()) from collections import Counter s = ns() cnt = Counter() for si in s: cnt[si] += 1 print('No') if (cnt['N'] > 0 and cnt['S'] == 0) or\ (cnt['N'] == 0 and cnt['S'] > 0) or\ (cnt['E'] > 0 and cnt['W'] == 0) or\ (cnt['E'] == 0 and cnt['W'] > 0) else print('Yes')
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | polarbear08 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 781 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 3316 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 | 21 ms | 3316 KB |
04.txt | AC | 21 ms | 3316 KB |
05.txt | AC | 21 ms | 3316 KB |
06.txt | AC | 21 ms | 3316 KB |
07.txt | AC | 21 ms | 3316 KB |
08.txt | AC | 21 ms | 3316 KB |
09.txt | AC | 21 ms | 3316 KB |
10.txt | AC | 21 ms | 3316 KB |
11.txt | AC | 21 ms | 3316 KB |
13.txt | AC | 21 ms | 3316 KB |
15.txt | AC | 21 ms | 3316 KB |
s1.txt | AC | 20 ms | 3316 KB |
s2.txt | AC | 20 ms | 3316 KB |
s3.txt | AC | 20 ms | 3316 KB |
s4.txt | AC | 20 ms | 3316 KB |