Submission #1853974

---

Source Code Expand

#include <iostream>
#include <cstdio>
using namespace std;

int n, num[100005], a[100005];
string ta;
int main()
{
    int i, j, k, t1, t2;
    cin >> n;
    cin >> ta;
    for (i = 0; i < n; i++) {
		if (ta[i] == 'o') a[i] = 0;
		else a[i] = 1;
    }
    a[n] = a[0];
    for (i = 0; i< 2; i++) {
        for (j= 0; j< 2; j++) {
            num[0] = i;
            num[1] = j;
            for (k = 1; k < n + 1; k++) {
				num[k+1]=((num[k - 1] ^ num[k]) ^ a[k]);
            }
            if (num[n] == num[0] && num[n+1] == num[1]) {
                for (k = 0; k < n; k++) {
                    if (num[k] == 0) printf("S");
                    else printf("W");
                }
                return 0;
            }
        }
    }
    cout << -1 << endl;
    return 0;
}

Submission Info

Judge Result