1067. Sort with Swap(0,*)

Given any permutation of the numbers {0, 1, 2,..., N-1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the swap operations in the following way:

Swap(0, 1) => {4, 1, 2, 0, 3}
Swap(0, 3) => {4, 1, 2, 3, 0}
Swap(0, 4) => {0, 1, 2, 3, 4}

Now you are asked to find the minimum number of swaps need to sort the given permutation of the first N nonnegative integers.

Input Specification:

Each input file contains one test case, which gives a positive N (<=10⁵) followed by a permutation sequence of {0, 1, ..., N-1}. All the numbers in a line are separated by a space.

Output Specification:

For each case, simply print in a line the minimum number of swaps need to sort the given permutation.

Sample Input:

10 3 5 7 2 6 4 9 0 8 1

Sample Output:

9

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <deque>
#include <queue>
#include <cstring>
#include <vector>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <algorithm>
using namespace std;
#define max1 1000000000
#define inf 6000
int main()
{
	int n;
    cin>>n;
    vector<int>a(n),b(n);
    for(int i=0;i<n;i++)
	{
		cin>>a[i];
		b[a[i]]=i;
	}
	int i=1;
	int count=0;
	while(true)
	{
		if(a[0]==0)
		{
			for(i;i<n;i++)
			{
				if(a[i]!=i)
				{
					break;
				}
			}
			if(i==n)break;
			else
			{
				swap(a[0],a[i]);
				swap(b[a[0]],b[a[i]]);
				count++;
			}
		}
		else
		{
			swap(a[b[b[0]]],a[b[0]]);
			swap(b[b[0]],b[0]);
			count++;
		}
	}
	cout<<count<<endl;
    return 0;
}