Submission #2229432

---

Source Code Expand

#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef long long ll;
const int inf   = 1<<29;
const ll  mod = 998244353;
ll fact[500001],invfact[500001];

int main(){
  int n;cin>>n;
  string s;cin>>s;
  char ans[n+1];
  ans[0]='S';ans[1]='S';
  rep(i,n){
    if(ans[i]==ans[i+1]^s[i]=='x')
      ans[i+2]='S';
    else ans[i+2]='W';
    }
  if(ans[0]==ans[n]&&ans[1]==ans[n+1]){
    rep(i,n)cout<<ans[i+1];
    cout<<endl;
    return 0;
    }
  ans[0]='S';ans[1]='W';
  rep(i,n){
    if(ans[i]==ans[i+1]^s[i]=='x')
      ans[i+2]='S';
    else ans[i+2]='W';
    }
  if(ans[0]==ans[n]&&ans[1]==ans[n+1]){
    rep(i,n)cout<<ans[i+1];
    cout<<endl;
    return 0;
    }
  ans[0]='W';ans[1]='S';
  rep(i,n){
    if(ans[i]==ans[i+1]^s[i]=='x')
      ans[i+2]='S';
    else ans[i+2]='W';
    }
  if(ans[0]==ans[n]&&ans[1]==ans[n+1]){
    rep(i,n)cout<<ans[i+1];
    cout<<endl;
    return 0;
    }
  ans[0]='W';ans[1]='W';
  rep(i,n){
    if(ans[i]==ans[i+1]^s[i]=='x')
      ans[i+2]='S';
    else ans[i+2]='W';
    }
  if(ans[0]==ans[n]&&ans[1]==ans[n+1]){
    rep(i,n)cout<<ans[i+1];
    cout<<endl;
    return 0;
    }
  cout<<-1<<endl;
  return 0;
  }

Submission Info

Judge Result