Submission #1773904

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef tuple<int,int> tii;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
#define DIV int(1e9+7)
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

 /* Coding Space*/
int n;
string str;

void dfs(string s){
  return;
while(1){
  int ss = s.size();
  char c = s[ss-1];
  char cb = s[ss-2];
  if(ss == n){
    if(s[ss-2] != s[0]){
      if((str[ss-1] == 'o' && s[ss-1] == 'W') || (str[ss-1] == 'x' && s[ss-1] == 'S'))
        {cout << s << endl; exit(0);}
      else
        return;
    }else{
      if((str[ss-1] == 'o' && s[ss-1] == 'S') || (str[ss-1] == 'x' && s[ss-1] == 'W'))
        {cout << s << endl; exit(0);}
      else
        return;
    }
  }
  if(c == 'S' && cb == 'W')
    (str[ss-1] == 'o')?s=s+"W":s=s+"S";
  if(c == 'S' && cb == 'S')
    (str[ss-1] == 'o')?s = s+"S":s = s+"W";
  if(c=='W' && cb == 'S')
    (str[ss-1] == 'o')?s = s+"W":s = s+"S";
  if(c == 'W' && cb == 'W')
    (str[ss-1] == 'o')?s = s+"S":s = s+"W";

}
  return;
}

int main(){
  cin >> n >> str;
  dfs("SS");
  dfs("SW");
  dfs("WS");
  dfs("WW");
  cout << -1 << endl;
}

Submission Info

Judge Result