Books Exchange (hard version) （图书交换（hard））

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

 

The only difference between easy and hard versions is constraints.

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

For example, if n=6and p=[4,6,1,3,5,2] then at the end of the first day the book of the 1 -st kid will belong to the 4 -th kid, the 2 -nd kid will belong to the 6 -th kid and so on. At the end of the second day the book of the 1 -st kid will belong to the 3 -th kid, the 2 -nd kid will belong to the 2 -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 i from 1 to n .

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

• after the 1 -st day it will belong to the 5 -th kid,
• after the 2 -nd day it will belong to the 3 -rd kid,
• after the 3 -rd day it will belong to the 2 -nd kid,
• after the 4 -th day it will belong to the 1 -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 q (1≤q≤1000 ) — the number of queries. Then q queries follow.

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

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

Output

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

Example

Input

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

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

 题意：每个人手里拿着1~n本书，第一天传给所处位置编号的那个人，问什么时候传到自己手里

思路：记忆化搜索，因为如果之前有搜到这一步的话，后面搜索的路线就都一样。。就用记忆化将走过的标记一下

#include<stdio.h>
#include<string.h>
#include<algorithm>
typedef long long ll;
const int N=2*1e5+10;
using namespace std;
int ans[N],a[N];
int book[N];
int dfs(int i,int step)
{
    book[i]=1;
    if(book[a[i]])
        return ans[i]=step;
    return ans[i]=dfs(a[i],step+1);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(ans,0,sizeof(ans));
        memset(book,0,sizeof(book));
        int n;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        for(int i=1; i<=n; i++)
        {
            if(book[i]==0)
                dfs(i,1);
        }
        for(int i=1; i<n; i++)
            printf("%d ",ans[i]);
        printf("%d\n",ans[n]);
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
#include<algorithm>
typedef long long ll;
const int N=2*1e5+10;
using namespace std;
int a[N],ans[N];
int solve(int i,int x,int duiying,int step)
{
    if(i==duiying)
        return ans[x]=step;
    return ans[x]=solve(i,duiying,a[duiying],step+1);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        memset(ans,0,sizeof(ans));
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        for(int i=1; i<=n; i++)
            if(ans[i]==0)
                solve(i,i,a[i],1);
        for(int i=1; i<n; i++)
            printf("%d ",ans[i]);
        printf("%d\n",ans[n]);
    }
    return 0;
}

给时间一点时间！