Submission #1604038

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
typedef long long ll;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int n;
string s;

int main(){
	cin >> n >> s;
	
	bool tmp[n+2], f=false;
	REP(i,0,4){
		tmp[0]=(i&1); tmp[1]=((i>>1)&1);
		REP(j,1,n){
			if(s[j]=='o'){
				tmp[j+1]=tmp[j]^tmp[j-1];
			}else{
				tmp[j+1]=not(tmp[j]^tmp[j-1]);
			}
		}
		if(tmp[n]==tmp[0]){
			if(s[0]=='o') tmp[n+1]=tmp[n]^tmp[n-1];
			else tmp[n+1]=not(tmp[n]^tmp[n-1]);
			if(tmp[n+1]==tmp[1]){
				f=true;
				break;
			}
		}
	}
	
	if(f) REP(i,0,n) cout << (tmp[i]?'W':'S');
	else cout << -1;
	
	cout << endl;
	return 0;
}

Submission Info

Judge Result