Submission #2214654

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
const int INF = sizeof(int) == sizeof(long long) ? LLONG_MAX : INT_MAX;
const int MOD = 1000000007;
const long double EPS = 1e-8;

signed main() {
	int n;
	string s;
	cin >> n >> s;
	rep (i, 2) {
		string ans = i ? "S" : "W";
		string tmp = ans;
		rep (j, 2) {
			ans = tmp;
			ans += j ? "S" : "W";
			/*
			*/
			range (k, 1, s.size()) {
				if (s[k] == 'o') {
					if (ans[k] == 'S')
						ans += ans[k - 1] == 'S' ? "S" : "W";
					else
						ans += ans[k - 1] == 'S' ? "W" : "S";
				}
				else {
					if (ans[k] == 'S')
						ans += ans[k - 1] == 'S' ? "W" : "S";
					else
						ans += ans[k - 1] == 'S' ? "S" : "W";
				}
			}
			if (s[0] == 'o') {
				if (ans[1] == 'S') {
					if (ans[0] == 'S') ans.insert(ans.begin(), 'S');
					else ans.insert(ans.begin(), 'W');
				}
				else {
					if (ans[0] == 'S') ans.insert(ans.begin(), 'W');
					else ans.insert(ans.begin(), 'S');
				}
			} else {
				if (ans[1] == 'S') {
					if (ans[0] == 'S') ans.insert(ans.begin(), 'W');
					else ans.insert(ans.begin(), 'S');
				}
				else {
					if (ans[0] == 'S') ans.insert(ans.begin(), 'S');
					else ans.insert(ans.begin(), 'W');
				}
			}

			if (ans[0] == ans[ans.size() - 2] && ans[1] == ans[ans.size() - 1]) {
				ans.pop_back();
				ans.erase(ans.begin());
				cout << ans << endl;
				return 0;
			}
		}
	}
	cout << -1 << endl;
	return 0;
}

Submission Info

Judge Result