B1. Books Exchange (easy version)【1000 / 并查集】

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

#include<bits/stdc++.h> 
using namespace std;
const int N=1e5+10;
int a[N],p[N],cnt[N],n,t;
int find(int x)
{
	if(x!=p[x]) p[x]=find(p[x]);
	return p[x];
}
int main(void)
{
	cin>>t;
	while(t--)
	{
		cin>>n;
		for(int i=1;i<=n;i++) p[i]=i,cnt[i]=1;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
			if(find(i)!=find(a[i])) cnt[find(i)]+=cnt[find(a[i])],p[find(a[i])]=find(i);
		}
		for(int i=1;i<=n;i++) cout<<cnt[find(i)]<<" ";
		cout<<endl;
	}
	return 0;
}