Submission #1768421

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int substr_count(string s, string substr)
{
	int count =0;
	size_t pos = s.find(substr);
	while(pos != string::npos)
	{
		count++;
		pos = s.find(substr,pos+1);
	}
	return count;
}
int main(void)
{
	string s;
	cin >> s;
	int nc = substr_count(s,"N");
	int sc = substr_count(s,"S");
	int ec = substr_count(s,"E");
	int wc = substr_count(s,"W");
	if( (sc > 0 && nc==0) || (sc==0 && nc > 0))
	{
		cout << "No" << endl;
	}
	else if( (ec > 0 && wc==0) || (ec==0 && wc > 0))
	{
		cout << "No" << endl;
	}else{
		cout << "Yes" << endl;
	}
	return 0;
}

Submission Info

Judge Result