Nowcoder Hash Function ( 拓扑排序 && 线段树优化建图 )

#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long

#define scl(i) scanf("%lld", &i)
#define scll(i, j) scanf("%lld %lld", &i, &j)
#define sclll(i, j, k) scanf("%lld %lld %lld", &i, &j, &k)
#define scllll(i, j, k, l) scanf("%lld %lld %lld %lld", &i, &j, &k, &l)

#define scs(i) scanf("%s", i)
#define sci(i) scanf("%d", &i)
#define scd(i) scanf("%lf", &i)
#define scIl(i) scanf("%I64d", &i)
#define scii(i, j) scanf("%d %d", &i, &j)
#define scdd(i, j) scanf("%lf %lf", &i, &j)
#define scIll(i, j) scanf("%I64d %I64d", &i, &j)
#define sciii(i, j, k) scanf("%d %d %d", &i, &j, &k)
#define scddd(i, j, k) scanf("%lf %lf %lf", &i, &j, &k)
#define scIlll(i, j, k) scanf("%I64d %I64d %I64d", &i, &j, &k)
#define sciiii(i, j, k, l) scanf("%d %d %d %d", &i, &j, &k, &l)
#define scdddd(i, j, k, l) scanf("%lf %lf %lf %lf", &i, &j, &k, &l)
#define scIllll(i, j, k, l) scanf("%I64d %I64d %I64d %I64d", &i, &j, &k, &l)

#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define lowbit(i) (i & (-i))
#define mem(i, j) memset(i, j, sizeof(i))

#define fir first
#define sec second
#define VI vector<int>
#define ins(i) insert(i)
#define pb(i) push_back(i)
#define pii pair<int, int>
#define VL vector<long long>
#define mk(i, j) make_pair(i, j)
#define all(i) i.begin(), i.end()
#define pll pair<long long, long long>

#define _TIME 0
#define _INPUT 0
#define _OUTPUT 0
clock_t START, END;
void __stTIME();
void __enTIME();
void __IOPUT();
using namespace std;
const int maxn = 2e5 + 10;

VI ans;
int PreSum[maxn];
int arr[maxn];
int Node[maxn];
int IN[maxn<<2];
int Pos[maxn<<2];

struct EDGE{ int v, nxt; }Edge[maxn<<4];
int Head[maxn<<2], EdgeCnt;

inline void init(int n)
{
    ans.clear();
    for(int i=0; i<=(n<<2); i++){
        IN[i] = 0;
        Head[i] = -1;
    }
    EdgeCnt = 0;
}

inline void AddEdge(int from, int to)
{
    Edge[EdgeCnt].v = to;
    Edge[EdgeCnt].nxt = Head[from];
    Head[from] = EdgeCnt++;
    IN[to]++;
}

void Build(int l, int r, int rt)
{
    if(l == r){
        sci(arr[l]);
        PreSum[l] = PreSum[l-1] + ( arr[l] == -1 );
        Node[l] = rt;
        Pos[rt] = l;
        return ;
    }

    Pos[rt] = 0;
    AddEdge(rt<<1|1, rt);
    AddEdge(rt<<1, rt);

    int m = (l + r) >> 1;
    Build(lson);
    Build(rson);
}

void Connect(int L, int R, int c, int l, int r, int rt)
{
    if(L <= l && r <= R){
        AddEdge(rt, c);
        return ;
    }

    int m = (l + r) >> 1;
    if(L <= m) Connect(L, R, c, lson);
    if(m < R) Connect(L, R, c, rson);
}

bool topo_sort(int n)
{
    priority_queue<pii, vector<pii>, greater<pii> > que;
    for(int i=1; i<=n; i++){
        if(IN[Node[i]] == 0){
            que.push(mk(arr[i], Node[i]));
        }
    }

    while(!que.empty()){
        pii top = que.top(); que.pop();

        if(top.fir != -1) ans.pb(top.fir);

        for(int i=Head[top.sec]; i!=-1; i=Edge[i].nxt){
            int Eiv = Edge[i].v;
            if(--IN[Eiv] == 0){
                if(Pos[Eiv] > 0) que.push(mk(arr[Pos[Eiv]], Eiv));
                else que.push(mk(-1, Eiv));
            }
        }
    }

    return ((int)ans.size() == n - PreSum[n]);
}

int main(void){__stTIME();__IOPUT();

    int nCase;
    sci(nCase);

    while(nCase--){

        int n;
        sci(n);

        init(n);

        Build(1, n, 1);

        if(PreSum[n] == n) { puts(""); continue; }

        bool ok = true;
        for(int i=1; i<=n; i++){
            if(arr[i] == -1) continue;
            if((arr[i]%n + 1) == i) continue;
            int L = arr[i]%n + 1, R = (i - 1) == 0 ? n : i - 1;
            if(L <= R){
                if(PreSum[R] - PreSum[L-1] > 0){ ok = false; break; }
                Connect(L, R, Node[i], 1, n, 1);
            }else{
                if(PreSum[n] - PreSum[L-1] + PreSum[R] > 0){ ok = false; break; }
                Connect(L, n, Node[i], 1, n, 1);
                Connect(1, R, Node[i], 1, n, 1);
            }
        }

        if(!ok) puts("-1");
        else{
            if(!topo_sort(n)) puts("-1");
            else for(int i=0; i<(int)ans.size(); i++) printf("%d ", ans[i]); puts("");
        }
    }


























__enTIME();return 0;}


void __stTIME()
{
    #if _TIME
        START = clock();
    #endif
}

void __enTIME()
{
    #if _TIME
        END = clock();
        cerr<<"execute time = "<<(double)(END-START)/CLOCKS_PER_SEC<<endl;
    #endif
}

void __IOPUT()
{
    #if _INPUT
        freopen("in.txt", "r", stdin);
    #endif
    #if _OUTPUT
        freopen("out.txt", "w", stdout);
    #endif
}