Submission #75818019

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define MOD 1000000007
#define INF 987654321
#define PI 3.1415926535

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

    int t;
    cin >> t;

    while (t--)
    {
        int n;
        cin >> n;

        string s;
        cin >> s;

        vector<int> ans(n, 2);

        for (int i = 0; i < n; i++)
        {
            set<int> st;

            bool b1 = s[(i + n - 1) % n] == s[(i + n - 2) % n];
            bool b2 = s[(i + n - 1) % n] == s[(i + 1) % n];
            bool b3 = s[(i + 1) % n] == s[(i + 2) % n];

            if (b1 || b2 || b3)
            {
                ans[i] = 1;
            }
        }

        for (int an : ans)
        {
            cout << an << ' ';
        }
        cout << '\n';
    }
}

Submission Info

Judge Result