这能cao过去应该能卡掉吧？没细想怎么hack，数据弱了点捏~

#include <bits/stdc++.h>
using namespace std;
namespace lgh {
#define int long long

const int N = 1e6 + 5;

int n;
int p[N], sum[N], pos, len, vis[N];

void check() {
    for (int i = 1; i <= n; ++i) vis[i] = 0;
    for (int i = 1; i <= n; ++i) 
        if (p[i] == 1) pos = i;
    for (int l = max(pos - len, 1ll); l <= pos; ++l) {
        for (int r = pos; r <= min(pos + len, n); ++r) {
            int t = (sum[r] - sum[l - 1]) - (r - l + 1);
            if (t < n) vis[t + 1] = 1;
        }
    }
    int tmp = -1;
    for (int i = 1; i <= n; ++i) 
        if (!vis[i]) tmp = i;
    if (tmp == -1) {
        puts("-1");
        return;
    }
    for (int i = 1; i <= n; ++i) {
        if (i == pos) printf("%lld ", tmp);
        else printf("%lld ", 1);
    }
    putchar(10);
}

void main() {
    int T; scanf(" %lld", &T); while (T--) {
        for (int i = 1; i <= n; ++i) vis[i] = 0;
        scanf(" %lld", &n);
        len = ceil((-1 + sqrt(8 * n + 1)) / 2) + 3;
        for (int i = 1; i <= n; ++i) {
            scanf(" %lld", &p[i]);
            sum[i] = sum[i - 1] + p[i];
            if (p[i] == n) pos = i;
        }
        for (int l = max(pos - len, 1ll); l <= pos; ++l) {
            for (int r = pos; r <= min(pos + len, n); ++r) {
                int t = (r - l + 1) * n - (sum[r] - sum[l - 1]);
                if (t < n) vis[n - t] = 1;
            }
        }
        int tmp = -1;
        for (int i = 1; i <= n; ++i) 
            if (!vis[i]) tmp = i;
        if (tmp == -1) {
            check();
            continue;
        }
        for (int i = 1; i <= n; ++i) {
            if (i == pos) printf("%lld ", tmp);
            else printf("%lld ", n);
        }
        putchar(10);
    }
}
}
main() {
    return lgh::main(), 0;
}