Submission #3435759


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;

bool check (string s, string ans) {

    int N = s.size();
    forn(i, s.size()) {
        char h;

        if (ans[i % N] == 'S') {
            if (ans[(i - 1 + N) % N] == ans[(i + 1) % N]) {
                h = 'o';
            } else {
                h = 'x';
            }
        }

        if (ans[i % N] == 'W') {
            if (ans[(i - 1 + N) % N] == ans[(i + 1) % N]) {
                h = 'x';
            } else {
                h = 'o';
            }
        }

        if (h != s[i]) return false;
    }

    return true;
}

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

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

    string ans = "SS";

    fore(i, 1, N - 2) {
        if (s[i] == 'o' and ans[i] == 'S') {
            ans += ans[i - 1];
        } else if (s[i] == 'o' and ans[i] == 'W') {
            if (ans[i -1] == 'S') ans += 'W';
            else ans += 'S';
        }
        if (s[i] == 'x' and ans[i] == 'S') {
            if (ans[i - 1] == 'S') ans += 'W';
            else ans += 'S';
        } else if (s[i] == 'x' and ans[i] == 'W') {
            ans += ans[i - 1];
        }
    }

    if (check(s, ans)) {
        cout << ans << endl;
        return 0;
    }

    ans = "SW";

    fore(i, 1, N - 2) {
        if (s[i] == 'o' and ans[i] == 'S') {
            ans += ans[i - 1];
        } else if (s[i] == 'o' and ans[i] == 'W') {
            if (ans[i -1] == 'S') ans += 'W';
            else ans += 'S';
        }
        if (s[i] == 'x' and ans[i] == 'S') {
            if (ans[i - 1] == 'S') ans += 'W';
            else ans += 'S';
        } else if (s[i] == 'x' and ans[i] == 'W') {
            ans += ans[i - 1];
        }
    }

    if (check(s, ans)) {
        cout << ans << endl;
        return 0;
    }

    ans = "WS";

    fore(i, 1, N - 2) {
        if (s[i] == 'o' and ans[i] == 'S') {
            ans += ans[i - 1];
        } else if (s[i] == 'o' and ans[i] == 'W') {
            if (ans[i -1] == 'S') ans += 'W';
            else ans += 'S';
        }
        if (s[i] == 'x' and ans[i] == 'S') {
            if (ans[i - 1] == 'S') ans += 'W';
            else ans += 'S';
        } else if (s[i] == 'x' and ans[i] == 'W') {
            ans += ans[i - 1];
        }
    }

    if (check(s, ans)) {
        cout << ans << endl;
        return 0;
    }

    ans = "WW";

    fore(i, 1, N - 2) {
        if (s[i] == 'o' and ans[i] == 'S') {
            ans += ans[i - 1];
        } else if (s[i] == 'o' and ans[i] == 'W') {
            if (ans[i -1] == 'S') ans += 'W';
            else ans += 'S';
        }
        if (s[i] == 'x' and ans[i] == 'S') {
            if (ans[i - 1] == 'S') ans += 'W';
            else ans += 'S';
        } else if (s[i] == 'x' and ans[i] == 'W') {
            ans += ans[i - 1];
        }
    }

    if (check(s, ans)) {
        cout << ans << endl;
        return 0;
    }

    cout << -1 << endl;

    return 0;
}

Submission Info

Submission Time
Task D - Menagerie
User kazuhitot
Language C++14 (GCC 5.4.1)
Score 500
Code Size 3670 Byte
Status AC
Exec Time 11 ms
Memory 848 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 16
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 1 ms 256 KB
01.txt AC 6 ms 640 KB
02.txt AC 3 ms 512 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 9 ms 800 KB
06.txt AC 4 ms 848 KB
07.txt AC 2 ms 384 KB
08.txt AC 2 ms 384 KB
09.txt AC 1 ms 256 KB
10.txt AC 2 ms 384 KB
11.txt AC 11 ms 848 KB
12.txt AC 11 ms 848 KB
13.txt AC 9 ms 848 KB