Submission #1495384

---

Source Code Expand

#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
typedef unsigned long long u64;
typedef signed long long l64;
u64 over = 1000000007;

int main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed;
  int n;
  string s;
  cin >> n >> s;
  bool ss[n];

  ss[0] = true; ss[1] = true;
  for (int i = 2; i < n; ++i) {
    if ((ss[i-1] && s[i-1]=='o' ) || (!ss[i-1] && s[i-1]=='x')) ss[i] = ss[i-2];
    else ss[i] = !ss[i-2];
  }
  if ((ss[n-1] && s[n-1]=='o' && ss[0]==ss[n-2]) || (ss[n-1] && s[n-1]=='x' && ss[0]!=ss[n-2]) ||
  (!ss[n-1] && s[n-1]=='o' && ss[0]!=ss[n-2]) || (!ss[n-1] && s[n-1]=='x' && ss[0]==ss[n-2])) {
    if ((ss[0] && s[0]=='o' && ss[1]==ss[n-1]) || (ss[0] && s[0]=='x' && ss[1]!=ss[n-1]) ||
    (!ss[0] && s[0]=='o' && ss[1]!=ss[n-1]) || (!ss[0] && s[0]=='x' && ss[1]==ss[n-1])) {
      for (int i = 0; i < n; ++i) cout << (ss[i] ? "S" : "W");
      cout << endl;
      return 0;
    }
  }

  ss[0] = true; ss[1] = false;
  for (int i = 2; i < n; ++i) {
    if ((ss[i-1] && s[i-1]=='o' ) || (!ss[i-1] && s[i-1]=='x')) ss[i] = ss[i-2];
    else ss[i] = !ss[i-2];
  }
  if ((ss[n-1] && s[n-1]=='o' && ss[0]==ss[n-2]) || (ss[n-1] && s[n-1]=='x' && ss[0]!=ss[n-2]) ||
  (!ss[n-1] && s[n-1]=='o' && ss[0]!=ss[n-2]) || (!ss[n-1] && s[n-1]=='x' && ss[0]==ss[n-2])) {
    if ((ss[0] && s[0]=='o' && ss[1]==ss[n-1]) || (ss[0] && s[0]=='x' && ss[1]!=ss[n-1]) ||
    (!ss[0] && s[0]=='o' && ss[1]!=ss[n-1]) || (!ss[0] && s[0]=='x' && ss[1]==ss[n-1])) {
      for (int i = 0; i < n; ++i) cout << (ss[i] ? "S" : "W");
      cout << endl;
      return 0;
    }
  }

  ss[0] = false; ss[1] = true;
  for (int i = 2; i < n; ++i) {
    if ((ss[i-1] && s[i-1]=='o' ) || (!ss[i-1] && s[i-1]=='x')) ss[i] = ss[i-2];
    else ss[i] = !ss[i-2];
  }
  if ((ss[n-1] && s[n-1]=='o' && ss[0]==ss[n-2]) || (ss[n-1] && s[n-1]=='x' && ss[0]!=ss[n-2]) ||
  (!ss[n-1] && s[n-1]=='o' && ss[0]!=ss[n-2]) || (!ss[n-1] && s[n-1]=='x' && ss[0]==ss[n-2])) {
    if ((ss[0] && s[0]=='o' && ss[1]==ss[n-1]) || (ss[0] && s[0]=='x' && ss[1]!=ss[n-1]) ||
    (!ss[0] && s[0]=='o' && ss[1]!=ss[n-1]) || (!ss[0] && s[0]=='x' && ss[1]==ss[n-1])) {
      for (int i = 0; i < n; ++i) cout << (ss[i] ? "S" : "W");
      cout << endl;
      return 0;
    }
  }

  ss[0] = false; ss[1] = false;
  for (int i = 2; i < n; ++i) {
    if ((ss[i-1] && s[i-1]=='o' ) || (!ss[i-1] && s[i-1]=='x')) ss[i] = ss[i-2];
    else ss[i] = !ss[i-2];
  }
  if ((ss[n-1] && s[n-1]=='o' && ss[0]==ss[n-2]) || (ss[n-1] && s[n-1]=='x' && ss[0]!=ss[n-2]) ||
  (!ss[n-1] && s[n-1]=='o' && ss[0]!=ss[n-2]) || (!ss[n-1] && s[n-1]=='x' && ss[0]==ss[n-2])) {
    if ((ss[0] && s[0]=='o' && ss[1]==ss[n-1]) || (ss[0] && s[0]=='x' && ss[1]!=ss[n-1]) ||
    (!ss[0] && s[0]=='o' && ss[1]!=ss[n-1]) || (!ss[0] && s[0]=='x' && ss[1]==ss[n-1])) {
      for (int i = 0; i < n; ++i) cout << (ss[i] ? "S" : "W");
      cout << endl;
      return 0;
    }
  }

  cout << -1 << endl;
  return 0;
}

Submission Info

Judge Result