Submission #3767413

---

Source Code Expand

#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)

void fill(vector<bool>& b, int n, string s) {
  repeat(i,2,n) {
    if(b[i-2]&&b[i-1]) { // ss
      if(s[i-1]=='o') {
        b[i]=true;
      } else {
        b[i]=false;
      }
    }
    if(!b[i-2]&&b[i-1]) { // ws
      if(s[i-1]=='o') {
        b[i]=false;
      } else {
        b[i]=true;
      }
    }
    if(b[i-2]&&!b[i-1]) { // sw
      if(s[i-1]=='o') {
        b[i]=false;
      } else {
        b[i]=true;
      }
    }
    if(!b[i-2]&&!b[i-1]) { // ww
      if(s[i-1]=='o') {
        b[i]=true;
      } else {
        b[i]=false;
      }
    }
  }
}

void print(vector<bool>& b) {
  for(auto x : b) {
    if(x) {
      cout << "S";
    } else {
      cout << "W";
    }
  }
  cout << endl;
}

bool check(vector<bool>& b, int n, string s) {
  rep(i,n) {
    if(b[i]&&s[i]=='o') {
      if(b[(i-1+n)%n]!=b[(i+1)%n])
        return false;
    }
    if(b[i]&&s[i]=='x') {
      if(b[(i-1+n)%n]==b[(i+1)%n])
        return false;
    }
    if(!b[i]&&s[i]=='o') {
      if(b[(i-1+n)%n]==b[(i+1)%n])
        return false;
    }
    if(!b[i]&&s[i]=='x') {
      if(b[(i-1+n)%n]!=b[(i+1)%n])
        return false;
    }
  }
  return true;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<setprecision(std::numeric_limits<float>::max_digits10);
  int n;
  cin>>n;
  string s;
  cin>>s;
  vector<bool> b(n);
  // s=true,w=false;
  vector<bool> c = {true,false};
  for(auto x1 : c) {
    for(auto x2 : c) {
      b[0]=x1;
      b[1]=x2;
      fill(b,n,s);
      if(check(b,n,s)) {
        print(b);
        return 0;
      }
    }
  }
  cout << -1 << endl;
  return 0;
}

Submission Info

Judge Result