The puzzle

The puzzle

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.
Input
The input starts with one line contains exactly one positive integer 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.
Output
For each test case, output one line with one number represents the minimum operations.
Sample Input
2
4
2 3 4 1
4
2 1 4 3
Sample Output
3
2
Hint
1<=T<=20,1<=n<=100000

输入的时候 要把这个数的当前位置是什么和当前位置是什么数 然后在交换数的时候另一个记录位置的数组也要变，直接代码

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string.h>
using namespace std;
long long int n,m,k,flag=0,a[1000009],b[1000009];
int main(){
    cin>>n;
    while(n--)
    {
        int cnt=0;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&k);
            a[i]=k;
            b[k]=i;
        }
        for(int i=1;i<=m;i++)
        {
            if(a[i]!=i)
            {
                cnt++;
                k=b[i];
                b[a[i]]=b[i];
                b[i]=i;
                swap(a[i],a[k]);
            }
        }
        cout<<cnt<<endl;
    }

}