Submission #1482505

---

Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>

using namespace std;
using ll = long long;
const ll INF = 1e9;

int N;
string P;
vector<char> T(100001);

char inv(char s) {
    return s == 'S' ? 'W' : 'S';
}

bool execute(char one, char two) {
    bool succ;
    T[0] = one;
    T[1] = two;

    for (int i = 1; i < N - 1; i++) {
        if (T[i] == 'S') {
            if (P[i] == 'o') {
                T[i+1] = T[i-1];
            } else {
                T[i+1] = inv(T[i-1]);
            }
        } else {
            if (P[i] == 'o') {
                T[i+1] = inv(T[i-1]);
            } else {
                T[i+1] = T[i-1];
            }
        }
    }
    if (T[0] == 'S') {
        if (P[0] == 'o' && T[N-1] != T[1]) return false;
        if (P[0] == 'x' && T[N-1] == T[1]) return false;
    } else {
        if (P[0] == 'x' && T[N-1] != T[1]) return false;
        if (P[0] == 'o' && T[N-1] == T[1]) return false;
    }
    if (T[N-1] == 'S') {
        if (P[N-1] == 'o') {
            succ = T[N-2] == T[0];
        } else {
            succ = T[N-2] != T[0];
        }
    } else {
        if (P[N-1] == 'o') {
            succ = T[N-2] != T[0];
        } else {
            succ = T[N-2] == T[0];
        }
    }

    return succ;
}

int main() {
    cin >> N >> P;

    if (execute('S', 'S') || execute('S', 'W') || execute('W', 'S') || execute('W', 'W')) {
        for(int i = 0; i < N; i++) cout << T[i];
        cout << endl;
    } else {
        cout << -1 << endl;
    }

    return 0;
}

Submission Info

Judge Result