Submission #1115338

---

Source Code Expand

// In the name of God

#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <deque>
#include <assert.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <math.h>
#include <bitset>
#include <iomanip>

using namespace std;

const int N = (int) 1e6 + 6, mod = (int) 0;
int res[N];
int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    string s;
    cin >> s;
    for (int a = 0; a < 2; ++a) {
        for (int b = 0; b < 2; ++b) {
            res[0] = a;
            res[1] = b;
            for (int j = 2; j < n; ++j) {
                res[j] = ((s[j - 1] != 'o') ^ res[j - 1]) ^ res[j - 2];
            }
            int flag = 1;
            for (int x = 0; x < n; ++x) {
                int pr = (x - 1 + n) % n, nx = (x + 1 + n) % n;
                if (((s[x] == 'o') ^ res[x]) != (res[pr] == res[nx]))
                    flag = 0;
            }
            if (flag) {
                for (int j = 0; j < n; ++j)
                    cout << (res[j] == 0? 'S': 'W');
                cout << endl;
                return 0;
            }
        }
    }
    cout << -1 << endl;
}

Submission Info

Judge Result