Submission #1919125

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<functional>
#include<stack>
#include<queue>
#include <iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>

#define DBG cerr << '!' << endl;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(10)

using namespace std;

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

char dp[100010];
int n;
string str;

bool check()
{
	for(int i = 2;i <= n+1;i++)
	{
		if(dp[i-2] == 'S')
		{
			if(dp[i-1] == 'S')
			{
				if(str[i-1] == 'o')dp[i] = 'S';
				else dp[i] = 'W';
			}
			else
			{
				if(str[i-1] == 'o')dp[i] = 'W';
				else dp[i] = 'S';
			}
		}
		else
		{
			if(dp[i-1] == 'S')
			{
				if(str[i-1] == 'o')dp[i] = 'W';
				else dp[i] = 'S';
			}
			else
			{
				if(str[i-1] == 'o')dp[i] = 'S';
				else dp[i] = 'W';
			}
		}
	}
	if(dp[0]==dp[n]&&dp[1]==dp[n+1])
	{
		return true;
	}
	else
	{
		return false;
	}
}

int main()
{
	cin >> n;
	cin >> str;
	str += str[0];
	str += str[1];
	
	dp[0] = 'S';dp[1] = 'S';
	if(check()){REP(i,n)cout << dp[i];cout << endl;return 0;}
	dp[0] = 'S';dp[1] = 'W';
	if(check()){REP(i,n)cout << dp[i];cout << endl;return 0;}
	dp[0] = 'W';dp[1] = 'S';
	if(check()){REP(i,n)cout << dp[i];cout << endl;return 0;}
	dp[0] = 'W';dp[1] = 'W';
	if(check()){REP(i,n)cout << dp[i];cout << endl;return 0;}
	
	cout << -1 << endl;
	
	return 0;
}

Submission Info

Judge Result