Submission #3737378

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223372036854775807LL
using ll = long long;
template<typename T>
using vec = vector<T>;
using P = pair<ll, ll>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
	fill((T *)array, (T *)(array + N), val);
}

const ll INF = 1e16;
const ll MOD = 1e9 + 7;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//ll pas[51][52];

signed main(){
	IOS;
	ll n;
	cin >> n;
	string s;
	cin >> s;
	vec<bool> t(n);
	for(int i = 0;i < (1 << 2);i++){
		for(int j = 0;j <= 1;j++){
			if((1 << j) & i)t[j] = true; //isSheep?
			else t[j] = false;
		}
		for(int j = 2;j < n;j++){
			if((t[j - 1] && (s[j - 1] == 'o') || (!t[j - 1] && (s[j - 1] == 'x'))))t[j] = t[j - 2];
			else t[j] = !t[j - 2];
		}
		if((t[n - 1] && (s[n - 1] == 'o') || (!t[n - 1] && (s[n - 1] == 'x'))) && t[0] != t[n - 2])continue;
		if((t[n - 1] && (s[n - 1] == 'x') || (!t[n - 1] && (s[n - 1] == 'o'))) && t[0] == t[n - 2])continue;
		if((t[0] && (s[0] == 'o') || (!t[0] && (s[0] == 'x'))) && t[1] != t[n - 1])continue;
		if((t[0] && (s[0] == 'x') || (!t[0] && (s[0] == 'o'))) && t[1] == t[n - 1])continue;
		for(int j = 0;j < n;j++){
			if(t[j])cout << 'S';
			else cout << 'W';
		}
		cout << endl;
		return 0;
	}
	dump(-1);
}	

Submission Info

Judge Result