Submission #3210023

---

Source Code Expand

#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#include <type_traits>
#include<bitset>
#define int long long
#define ll long long
#define mod  1000000007
#define inf 1e17
#define rep(i,j,n) for(int i=j;i<n;i++)
#define P pair<int,int>
double pi = 3.141592653589793;
using namespace std;
//ここから始めよう
signed main(){
    int n;string s;cin>>n>>s;
    s+=s;
    cout<<s<<endl;
    int animal[114514]={};
    rep(i,0,1<<2){
        rep(j,0,2){
            if(i&(1<<j))animal[j]=1;
        }
        rep(j,1,n+1){
            if((animal[j]==1&&s[j]=='o')||(animal[j]==0&&s[j]=='x'))animal[j+1]=animal[j-1];
            else animal[j+1]=animal[j-1]*-1+1;
        }
       // rep(j,0,n+1)cout<<animal[j];cout<<endl;
        if(animal[n]==animal[0]&&animal[n+1]==animal[1]){
            rep(j,0,n){if(animal[j]==0)cout<<'W';else cout<<'S';}cout<<endl;return 0;
        }
    }cout<<-1<<endl;return 0;
}

Submission Info

Judge Result