Submission #1115958

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for(ut i=(a);i<(ut)(b);i++)
#define REP(i,b) FOR(i,0,b)
#define ALL(c) c.begin(),c.end()
#define PB push_back
#define cat //cout << __LINE__ << endl;
using namespace std;
typedef long long LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef pair<ut,ut> pr;
const int SIZE=5+1e6;
const int INF=10+1e9;
const LL p=7+1e9;
bool A[SIZE];
bool ans[SIZE];
LL N;
bool dx[]={0,0,1,1},dy[]={0,1,0,1};
bool issure(bool x[SIZE]){
	REP(i,N){
		if(x[i] == A[i]) if(x[(i+1)%N]!=x[(i-1+N)%N]) return false;
		if(x[i] != A[i]) if(x[(i+1)%N]==x[(i-1+N)%N]) return false;
	}
	return true;
}
int main(){
	cin >> N;
	string s;
	cin >> s;
	REP(i,N){
		A[i]=s[i]=='o';
	}
	bool answer=false;
	REP(i,4){
		ans[0]=dx[i];
		ans[1]=dy[i];
		FOR(j,2,N){
			if(ans[j-1] == A[j-1]) ans[j]=ans[j-2];
			else ans[j]=!ans[j-2];
		}
		if(issure(ans)){
			REP(j,N)
				cout << (ans[j]?'S':'W');
			cout << endl;
			return 0;
		}
	}
	cout << -1 << endl;
	return 0;
}

Submission Info

Judge Result