Submission #1115945

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <utility>
#include <set>
#include <map>
#include <deque>
#include <stack>

using namespace std;

void out(int n, vector<int> res) {
     for (int i = 0; i < n; ++i)
         cout << (res[i] ? 'S' : 'W');
     cout << "\n";
     
    cin >> n;
     exit(0);
}
 
int main() {
    int n;
    string s;
    cin >> n >> s;
    s += s[0];
    s += s[1];
    vector<int> res(n+2, 0);
    for (res[0] = 0; res[0] <= 1; ++res[0])
        for (res[1] = 0; res[1] <= 1; ++res[1]) {
            for (int i = 1; i <= n; ++i)
                res[i+1] = res[i-1] ^ (s[i] == 'x') ^ res[i] ^ 1;
            if (res[n] == res[0] && res[n+1] == res[1])
               out(n, res);
        }
    cout << "-1\n";
    
    cin >> n;
    return 0;
}

Submission Info

Judge Result