Account Got Falsely Flagged [@linust]

#	User	Rating
1	Benq	3676
2	Kevin114514	3659
3	jiangly	3640
4	turmax	3450
5	tourist	3408
6	strapple	3360
7	Um_nik	3354
8	squareOf105	3348
9	maroonrk	3312
10	idontwannadothis…e	3191

#	User	Contrib.
1	Qingyu	154
2	nik_exists	151
3	maspy	149
4	AmShZ	146
5	Um_nik	143
6	Errichto	139
7	BledDest	136
8	adamant	135
9	maroonrk	133
10	cry	130

From him:

I am writing this blog to formally request a manual review of my recent account ban, which was specifically triggered after I submitted the solution for G in today's Educational Codeforces Round 196.

I have massive respect for the administration’s efforts to keep the leaderboards clean of LLM abuse. I was surprised by the restriction and would like to request a manual review of the relevant submission.

For this problem, I worked through the solution using bitmask transitions and binary lifting.

The Code

#include <bits/stdc++.h>

const int LOG = 60;

void cook() {
    int n, m, q;
    std::cin >> n >> m >> q;

    std::vector<int> k(n), in(n);

    for (int &x : k) std::cin >> x;

    for (int i = 0; i < m; i++) {
        int u, v;
        std::cin >> u >> v;
        --u; --v;
        in[v] |= 1 << u;
    }

    int S = 1 << n;
    std::vector<std::vector<int>> up(LOG, std::vector<int>(S));

    for (int mask = 0; mask < S; mask++) {
        for (int v = 0; v < n; v++)
            if (__builtin_popcount((unsigned)(mask & in[v])) >= k[v])
                up[0][mask] |= 1 << v;
    }

    for (int j = 1; j < LOG; j++)
        for (int mask = 0; mask < S; mask++)
            up[j][mask] = up[j-1][up[j-1][mask]];

    while (q--) {
        long long t;
        std::cin >> t;

        std::vector<std::pair<int, int>> a(n);

        for (int i = 0; i < n; i++) {
            std::cin >> a[i].first;
            a[i].second = i;
        }

        std::sort(a.begin(), a.end());

        std::vector<int> ans(n);
        int mask = 0, done = 0;

        for (int i = 0; i < n;) {
            int j = i, x = a[i].first;

            while (j < n && a[j].first == x)
                mask |= 1 << a[j++].second;

            int cur = mask;

            for (int b = 0; b < LOG; b++)
                if (t >> b & 1LL)
                    cur = up[b][cur];

            int add = cur & ~done;

            while (add) {
                int v = __builtin_ctz((unsigned)add);
                ans[v] = x;
                add &= add - 1;
            }

            done |= cur;
            i = j;
        }

        for (int i = 0; i < n; i++)
            std::cout << ans[i] << " \n"[i == n - 1];
    }
}

int main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);

    cook();
    return 0;
}

I am happy to explain the algorithm, the implementation, the debugging process, and the decisions behind the final code. I can also provide any relevant working notes or other information that would help establish the circumstances of the submission.

The profile that got banned: https://codeforces.me/profile/linust

Any review are welcome

Thank you for your time.