Submission #844827
Source Code Expand
#include <algorithm> #include <cmath> #include <climits> #include <cstdio> #include <cstdlib> #include <cstring> #include <fstream> #include <iostream> #include <list> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <cassert> #include <functional> using namespace std; #define LOG(...) printf(__VA_ARGS__) //#define LOG(...) #define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i) #define REP(i,n) for(int i=0;i<(int)(n);++i) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) #define RSORT(c) sort((c).rbegin(),(c).rend()) #define CLR(a) memset((a), 0 ,sizeof(a)) typedef long long ll; typedef unsigned long long ull; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<vb> vvb; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 }; struct UnionFind { vector<int> v; UnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; } int find(int x) { return v[x] == x ? x : v[x] = find(v[x]); } void unite(int x, int y) { v[find(x)] = find(y); } }; int main() { string s; cin >> s; int ns = 0; int we = 0; REP(i, s.length()) { if (s[i] == 'N') ns|=1; if (s[i] == 'W') we|=1; if (s[i] == 'S') ns |= 2; if (s[i] == 'E') we|=2; } if ((ns == 0 || ns == 3) && (we == 0 || we == 3)) cout << "Yes" << endl; else cout << "No" << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Wanna go back home |
User | masha_encount |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1698 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 |