Submission #75816784

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

// https://github.com/skrewbar/cp-templates

#define all(v) (v).begin(), (v).end()
#define compress(v) \
    sort(all(v));   \
    v.erase(unique(all(v)), (v).end())
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; }
#define by_desc(x) [](const auto& a, const auto& b) { return a.x > b.x; }

template <typename T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
bool minimize(T& target, T candidate) {
    return target > candidate ? (target = candidate, true) : false;
}
template <typename T>
bool maximize(T& target, T candidate) {
    return target < candidate ? (target = candidate, true) : false;
}

int N;
string S;

char getS(int i) {
    return S[((i % N) + N) % N];
}

void solve() {
    cin >> N;
    cin >> S;

    for (int i = 0; i < N; i++) {
        if (getS(i - 2) == getS(i - 1)
            or getS(i + 1) == getS(i + 2)
            or getS(i - 1) == getS(i + 1))
            cout << 1 << ' ';
        else
            cout << 2 << ' ';
    }

    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--)
        solve();

    return 0;
}

Submission Info

Judge Result