python 实现pat Sort with Swap(0,*)

题目 Sort with Swap(0,*) (25)

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.
输入描述:

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

输出描述:

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

10 3 5 7 2 6 4 9 0 8 1
输出

9

解答

line=[int(x) for x in input().split(' ')]
N=line[0]
nums=line[1:]
index=0
swaps=0
visited=[False]*N
#先计算有0环元素个数
while (nums[index] != 0):
    index = nums[index]
    visited[index] = True
    swaps+=1
#print (swaps)
# 再计算无0环元素个数
for i in range(1,N):
    if (visited[i] == False and nums[i] != i):
        swaps += 1
        index = i
        visited[index] = True
        swaps += 1
        while ( nums[index] != i):
            index = nums[index]
            visited[index] = True
            swaps += 1
print (swaps)