7224: The puzzle

五更眠；最无益，莫过一日曝十日寒。

7224: The puzzle

时间限制: 1 Sec  内存限制: 128 MB
提交: 90  解决: 46
[提交] [状态] [讨论版] [命题人:admin]

题目描述

Kayaking is playing a puzzle game containing n different blocks. He marks the blocks with integers from 1 to n, which show the blocks’ original positions. Each time he can exchange two blocks and he wants to know how many times he needs at least to restore the puzzle.

 

输入

The input starts with one line contains exactly one positive integer T which is the number of test cases.
Each test case contains two lines.
The first line contains an integer, which indicates the number of puzzle pieces.
The second line contains n different integers, the i-th number means the mark of the block in the i-th position.

 

输出

For each test case, output one line with one number represents the minimum operations.

 

样例输入

2
4
2 3 4 1
4
2 1 4 3

 

样例输出

3
2

 

提示

1≤T≤20,1≤n≤100000

 

来源/分类

2018黑龙江省赛 

 

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[100010],vis[100010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(vis,0,sizeof(vis));
        int n,ans=0;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        for(int i=1; i<=n; i++)
        {
            int j=a[i],num=0;
            while(!vis[j])
            {
                vis[j]=1;
                j=a[j];
                num++;
            }
            if(num>0)
                ans+=num-1;
        }

        printf("%d\n",ans);
    }
    return 0;
}