#595 (Div. 3) B2.Books Exchange (hard version)（模拟+找规律）

题目描述

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 pi are distinct integers from 1 to n (i.e. p is a permutation). The sequence p doesn’t change from day to day, it is fixed.
For example, if n=6 and 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 i-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 q 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 n over all queries does not exceed 2⋅105).

Output

For each query, print the answer on it: n integers a1,a2,…,an, where ai 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

题目大意

有n个孩子，每个孩子都有一本书，在一天结束之后，第i个孩子就会把自己的数给第p[i]个孩子。问：第i个（1<=i<=n）孩子的书最少要经过多少天才会重新回到他手里。

题目分析

这道题的数据范围扩大到了2e5，因此只能用O(n)的方法来解题了，所以我们要找规律来优化暴力模拟法。
以样例三为例：
1 -> 4 -> 1；
2 -> 6 -> 3 -> 2；
3 -> 2 -> 6 -> 3；
4 -> 1 -> 4；
5 -> 5 ；
6 -> 3 -> 2 -> 6；
我们可以发现：
1的路径上涉及了两个点1，4。
1 -> 4 -> 1；
4 -> 1 -> 4；
1 -> 4 -> 1 ->4；
2的路径上涉及了三个点2，3，6。
2 -> 6 -> 3 -> 2；
3 -> 2 -> 6 -> 3；
6 -> 3 -> 2 -> 6；
2 -> 6 -> 3 -> 2 -> 6 ->3；
我们可以发现：这些路径都组成了一个环，每个环上的所有点的答案都是相同的。
因此我们可以进行如下的优化：
先选择一个点进行路径模拟，同时记录下该路径上所有的点。因为这条路径上所有的点的答案都是相同的，所以把这些点的答案全部赋成与模拟点相同的答案即可。

代码如下

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <stack>
#include <map>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <iomanip>
#define LL long long
using namespace std;
const int N=2e5+5;
int p[N];
int ans[N];		//记录答案
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(ans,0,sizeof ans);	//清空ans数组
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
			scanf("%d",&p[i]);
		
		for(int i=1;i<=n;i++)
		{
			if(ans[i]) continue; 	//如果该点在之前已被用过，跳过即可
			int t=p[i],cnt=1;		//t：模拟路径； cnt：记录步数；
			queue<int> q;
			q.push(i);				//先将i点放入队列
			while(t!=i)		//模拟路径
			{
				cnt++;
				q.push(t);	//将路径上的点放入队列
				t=p[t];		//继续下一步
			}
			while(q.size())	//记录答案
			{
				t=q.front();
				q.pop();
				ans[t]=cnt;
			}
		}
		for(int i=1;i<=n;i++)
			cout<<ans[i]<<' ';
		puts("");
	}
	return 0;
}