Submission #3435291

---

Source Code Expand

#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define for1(i, n) for (int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using namespace std;

typedef long long i64;
typedef vector<int> vi;
typedef vector<i64> vi64;
typedef vector<vi> vvi;
typedef vector<vi64> vvi64;
typedef double ld;

int main() {
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int N;
    string s;
    cin >> N >> s;

    vi vs(N, 0);
    forn(i, N) {
        if (s[i] == 'x') vs[i] = 1;
    }
    vi _vs(N, 0);

    string ans(N, 'S');



    forn(i, N - 1) {
        if (vs[i] != _vs[i]) {
            ans[i + 1] = 'W';
            fore(j, i, i + 2) {
                int _j = j;
                if (_j >= N) _j -= N;
                _vs[_j] ^= 1;
            }
        }
    }

    // for (auto c: vs) cout << c; cout << endl;
    // for (auto c: _vs) cout << c; cout << endl;

    if (vs[N - 1] == _vs[N - 1] and vs[0] == _vs[0]) {
        cout << ans << endl;
    } else { 
        cout << -1 << endl;
    }

    return 0;
}

Submission Info

Judge Result