dfs（找环）

https://codeforces.com/problemset/problem/1249/B2

B2. Books Exchange (hard version)

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The only difference between easy and hard versions is constraints.

There are nn kids, each of them is reading a unique book. At the end of any day, the ii-th kid will give his book to the pipi-th kid (in case of i=pii=pi the kid will give his book to himself). It is guaranteed that all values of pipi are distinct integers from 11 to nn (i.e. pp is a permutation). The sequence pp doesn't change from day to day, it is fixed.

For example, if n=6n=6 and p=[4,6,1,3,5,2]p=[4,6,1,3,5,2] then at the end of the first day the book of the 11-st kid will belong to the 44-th kid, the 22-nd kid will belong to the 66-th kid and so on. At the end of the second day the book of the 11-st kid will belong to the 33-th kid, the 22-nd kid will belong to the 22-th kid and so on.

Your task is to determine the number of the day the book of the ii-th child is returned back to him for the first time for every ii from 11 to nn.

Consider the following example: p=[5,1,2,4,3]p=[5,1,2,4,3]. The book of the 11-st kid will be passed to the following kids:

• after the 11-st day it will belong to the 55-th kid,
• after the 22-nd day it will belong to the 33-rd kid,
• after the 33-rd day it will belong to the 22-nd kid,
• after the 44-th day it will belong to the 11-st kid.

So after the fourth day, the book of the first kid will return to its owner. The book of the fourth kid will return to him for the first time after exactly one day.

You have to answer qq independent queries.

Input

The first line of the input contains one integer qq (1≤q≤10001≤q≤1000) — the number of queries. Then qqqueries follow.

The first line of the query contains one integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the number of kids in the query. The second line of the query contains nn integers p1,p2,…,pnp1,p2,…,pn (1≤pi≤n1≤pi≤n, all pipi are distinct, i.e. pp is a permutation), where pipi is the kid which will get the book of the ii-th kid.

It is guaranteed that ∑n≤2⋅105∑n≤2⋅105 (sum of nn over all queries does not exceed 2⋅1052⋅105).

Output

For each query, print the answer on it: nn integers a1,a2,…,ana1,a2,…,an, where aiai is the number of the day the book of the ii-th child is returned back to him for the first time in this query.

Example

input

Copy

6
5
1 2 3 4 5
3
2 3 1
6
4 6 2 1 5 3
1
1
4
3 4 1 2
5
5 1 2 4 3

output

Copy

1 1 1 1 1 
3 3 3 
2 3 3 2 1 3 
1 
2 2 2 2 
4 4 4 1 4 

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdio.h>
#include <queue>
#include <stack>;
#include <map>
#include <set>
#include <string.h>
#include <vector>
#define ME(x , y) memset(x , y , sizeof(x))
#define SF(n) scanf("%d" , &n)
#define rep(i , n) for(int i = 0 ; i < n ; i ++)
#define INF  0x3f3f3f3f
#define mod 998244353
#define PI acos(-1)
using namespace std;
typedef long long ll ;
int vis[200009] , a[200009];
int sum ;

void dfs(int x , int i)
{
    sum++ ;
    if(x == i)
    {
        vis[x] = sum ;
        return ;
    }
    else
    {
        x = a[x];
        dfs(x , i);
        vis[x] = sum ;
    }
}

int main()
{

    int t ;
    scanf("%d" , &t);
    while(t--)
    {
        int n ;
        scanf("%d" , &n);
        for(int i = 1 ; i <= n ; i++)
        {
            scanf("%d" , &a[i]);
            vis[i] = 0 ;
        }

        for(int i = 1 ; i <= n ; i++)
        {
            sum = 0 ;
            if(!vis[i])
                dfs(a[i] , i);
        }

        for(int i = 1 ; i < n ; i++)
        {
            cout << vis[i] << " ";
        }
        cout << vis[n] << endl ;
    }

    return 0 ;
}

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdio.h>
#include <queue>
#include <stack>;
#include <map>
#include <set>
#include <string.h>
#include <vector>
#define ME(x , y) memset(x , y , sizeof(x))
#define SF(n) scanf("%d" , &n)
#define rep(i , n) for(int i = 0 ; i < n ; i ++)
#define INF  0x3f3f3f3f
#define mod 998244353
#define PI acos(-1)
using namespace std;
typedef long long ll ;
int vis[200009] , a[200009];


int main()
{

    int t ;
    scanf("%d" , &t);
    while(t--)
    {
        int n ;
        scanf("%d" , &n);
        for(int i = 1 ; i <= n ; i++)
        {
            scanf("%d" , &a[i]);
            vis[i] = 0 ;
        }
        queue<int>q;
        for(int i = 1 ; i <= n ; i++)
        {
            if(vis[i]) continue ;
            int pos = i ;
            do
            {
                q.push(pos);
                pos = a[pos];
            }while(pos!=i);
            int cnt = q.size();
            while(!q.empty())
            {
                vis[q.front()] = cnt ;
                q.pop();
            }

        }
        for(int i = 1 ; i < n ; i++)
        {
            cout << vis[i] << " ";
        }
        cout << vis[n] << endl ;
    }

    return 0 ;
}