competitiveprogramming/codechefcycles.py at master · gauraviuiux/competitiveprogramming · GitHub

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
n = int(input())

perm = [0] + list(map(int, input().split()))


index = 1

last = 1

dim = 0


ans = []

ans.append([])

visited = [True, True] + [False]*(n-1)


def first_unvisited():

    for i in range(n+1):

        if not visited[i]:

            return i

    else:

        return -1


while True:

    ans[dim].append(index)

    index = perm[index]

    visited[index] = True


    if index == last:

        unvisited_ind = first_unvisited()

        ans[dim].append(index)


        if unvisited_ind == -1:

            break

        else:

            index = unvisited_ind

            last = index

            ans.append([])

            dim+=1


print(dim+1)

for i in range(dim+1):

    print(" ".join(map(str, ans[i])))