Codeforces Round #595 (Div. 3) B2. Books Exchange (hard version)

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define fi ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(a) a.begin(),a.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define i64 long long int
const double pi = acos(-1.0);
const int maxn = (i64)2e5+5;

int arr[200005];
int ans[200005];
int main()
{
    fi;
    int q,i;
    cin>>q;
    while(q--)
    {
        int n;
        mem(ans,0);
        cin>>n;
        for(i = 1 ; i<=n ; i++) cin>>arr[i];
        for(i = 1 ; i<=n ; i++)
        {
            vector<int>v;
            while(ans[i] == 0)
            {
                v.pb(i);
                ans[i] = 1;
                i = arr[i];
            }
            for(auto it : v) ans[it] = v.size();
        }
        for(i = 1 ; i<=n ; i++) cout<<ans[i]<<" ";
        cout<<"\n";
    }
return 0;
}