1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
ll tt,n,a[(int)2e5+9],son[(int)2e5+9];
bitset<(int)2e5+9> vis;
struct dsu{
vi fa,sz;
dsu(int n){
fa.resize(n+1),sz.resize(n+1);
for(int i=1;i<=n;++i)fa[i]=i,sz[i]=1;
}
int fnd(int x){
return fa[x]==x?x:fa[x]=fnd(fa[x]);
}
bool merge(int x ,int y){
int oa=fnd(x),ob=fnd(y);
if(oa!=ob){
fa[ob]=oa,sz[oa]+=sz[ob];
return true;
}
return false;
}
};
vi g[(int)2e5+9];
ll dfs(ll u,ll &ans){
ll res=0;
for(auto it:g[u]){
res+=dfs(it,ans);
if(!vis[it])son[u]+=son[it];
}
ans+=res*son[u];
son[u]+=!vis[u];
return res+(vis[u]);
}
void solve(){
cin>>n;
dsu d(n);
vector<int> cycle;
f(i,1,n)cin>>a[i];
f(i,1,n)a[i]+=i;
f(i,1,n)if(1<=a[i]&&a[i]<=n){g[a[i]].push_back(i);}
f(i,1,n)son[i]=0ll;
bool ok=true;
vis.reset();
ll ans=0,cnt=0,sz=0,p=1,lst=1;
for(;1<=p&&p<=n;vis[p]=1,lst=p,p=a[p],sz+=1)if(vis[p]){ok=false;break;}
if(ok)dfs(lst,ans);
vis.reset();
for(int i=1;i<=n;++i){
if(1<=a[i]&&a[i]<=n)if(!d.merge(i,a[i]))cycle.push_back(d.fnd(i));
}
for(auto it:cycle)vis[d.fnd(it)]=1;
for(int i=1,x;i<=n;++i)x=d.fnd(i),cnt+=(x!=d.fnd(1)&&!vis[x]);
if(!ok)ans+=(cnt+1ll+n)*sz;
else {
ans+=(cnt+1ll+n)*sz+(n-sz)*(2ll*n+1ll)+(sz)*(sz-1ll)/2;
}
cout<<ans<<"\n";
f(i,1,n)g[i].clear();
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>tt;
f(sb,1,tt)solve();
return 0;
}
|