Submission #844399
Source Code Expand
Copy
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.OutputStream; import java.io.PrintWriter; import java.io.BufferedWriter; import java.io.Writer; import java.io.OutputStreamWriter; import java.util.InputMismatchException; import java.io.IOException; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top * * @author ilyakor */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); OutputWriter out = new OutputWriter(outputStream); TaskA solver = new TaskA(); solver.solve(1, in, out); out.close(); } static class TaskA { public void solve(int testNumber, InputReader in, OutputWriter out) { String s = in.nextToken(); int m1 = 0, m2 = 0; for (int i = 0; i < s.length(); ++i) { char c = s.charAt(i); if (c == 'N') m1 |= 1; if (c == 'S') m1 |= 2; if (c == 'E') m2 |= 1; if (c == 'W') m2 |= 2; } if (m1 != 0 && m1 != 3) { out.printLine("No"); return; } if (m2 != 0 && m2 != 3) { out.printLine("No"); return; } out.printLine("Yes"); } } static class OutputWriter { private final PrintWriter writer; public OutputWriter(OutputStream outputStream) { writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream))); } public OutputWriter(Writer writer) { this.writer = new PrintWriter(writer); } public void print(Object... objects) { for (int i = 0; i < objects.length; i++) { if (i != 0) { writer.print(' '); } writer.print(objects[i]); } } public void printLine(Object... objects) { print(objects); writer.println(); } public void close() { writer.close(); } } static class InputReader { private InputStream stream; private byte[] buffer = new byte[10000]; private int cur; private int count; public InputReader(InputStream stream) { this.stream = stream; } public static boolean isSpace(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } public int read() { if (count == -1) { throw new InputMismatchException(); } try { if (cur >= count) { cur = 0; count = stream.read(buffer); if (count <= 0) return -1; } } catch (IOException e) { throw new InputMismatchException(); } return buffer[cur++]; } public int readSkipSpace() { int c; do { c = read(); } while (isSpace(c)); return c; } public String nextToken() { int c = readSkipSpace(); StringBuilder sb = new StringBuilder(); while (!isSpace(c)) { sb.append((char) c); c = read(); } return sb.toString(); } } }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | ilyakor |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 3793 Byte |
Status | AC |
Exec Time | 201 ms |
Memory | 8276 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 | 159 ms | 8148 KB |
04.txt | AC | 157 ms | 8148 KB |
05.txt | AC | 151 ms | 8144 KB |
06.txt | AC | 158 ms | 8276 KB |
07.txt | AC | 159 ms | 8148 KB |
08.txt | AC | 154 ms | 8148 KB |
09.txt | AC | 160 ms | 8148 KB |
10.txt | AC | 163 ms | 8144 KB |
11.txt | AC | 193 ms | 8144 KB |
13.txt | AC | 152 ms | 8148 KB |
15.txt | AC | 159 ms | 8148 KB |
s1.txt | AC | 201 ms | 8148 KB |
s2.txt | AC | 163 ms | 8020 KB |
s3.txt | AC | 153 ms | 8148 KB |
s4.txt | AC | 151 ms | 8144 KB |