Submission #1115941

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define re return
#define mp make_pair
#define se second
#define sz(a) (int)a.size()
typedef long long ll;

const ll mod = 1e9 + 7;
ll n;
string s, ans;
void solve() {
	for (int i = 1; i + 1 < n; i++) {
		int k = 0;
		if (s[i] == 'x') k = 1;
		if (ans[i] == 'W') k = 1 - k;
		if (k == 0)
			ans += ans[i - 1];
		else {
			if (ans[i - 1] == 'S')
				ans += 'W';
			else
				ans += 'S';
		}
	}
	//cout << ans<< "\n";
	int k = 0;
	if (s[n - 1] == 'x')
		k = 1;
	if (ans[n - 1] == 'W')
		k = 1 - k;
	if ((k && ans[0] == ans[n - 2]) || (k == 0 && ans[0] != ans[n - 2]))
		re;
	k = 0;
	if (s[0] == 'x') k = 1;
	if (ans[0] == 'W')
		k = 1 - k;
	if ((k && ans[1] == ans[n - 1]) || (k == 0 && ans[1] != ans[n - 1]))
		re;
	cout << ans << "\n";
	exit(0);
}

int main() {
	iostream::sync_with_stdio(0);
	//freopen("a.in", "r", stdin);
	cin >> n >> s;
	ans = "SS";
	solve();
	ans = "SW";
	solve();
	ans = "WS";
	solve();
	ans = "WW";
	solve();
	cout << "-1\n";
}	

Submission Info

Judge Result