Submission #1654461

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

int n; string str;
bool ani[100000];

//1 is sheep, 0 is wolf
bool solve(bool a, bool b){
  ani[0]=a; ani[1]=b;
  int idx=2;
  while(idx <= n-1){
    if((ani[idx-1] == 1 && str[idx-1] == 'o') ||
    (ani[idx-1] == 0 && str[idx-1] == 'x')){
          ani[idx]=ani[idx-2];
    }else{
      ani[idx]=!(ani[idx-2]);
    }
    idx++;
  }

  if((ani[n-1] == 1 && str[n-1] == 'o') ||
  (ani[n-1] == 0 && str[n-1] == 'x')){
    if(ani[n-2] == ani[0]) return true;
    else return false;
  }else{
    if(ani[n-2] == ani[0]) return false;
    else return true;
  }
}

void print(){
  for(int i=0;i<n;i++){
    if(ani[i]) cout << 'S';
    else cout << 'W';
  }
  cout << endl;
}

int main(){
  cin >> n >> str;
  if(solve(1, 1)){
    print();
  }else if(solve(0, 0)){
    print();
  }else if(solve(0, 1)){
    print();
  }else if(solve(1, 0)){
    print();
  }else{
    cout << -1 << endl;
  }
}

Submission Info

Judge Result