Hello everyone my solution got accepted but can you suggest a more efficient solution, the fact we need to run the loops twice is bothering me..
#include<bits/stdc++.h>
using namespace std;
 
int main()
{
        int n,i,j,z=0,k,count=0;
        
        scanf("%d",&n);
        vector< int > p[n];
        bool visit[n];
        
        for(i=0;i<n;i++)
        visit[i]=false;
        
        
        
        for(i=0;i<n;i++)
        scanf("%d",&k),p[i].push_back(k);
        
        
        i=1;k=0,count=0;
        
        while(count!=n)
        {
                visit[i-1]=true;
                i=p[i-1][0];count++;
                //printf("%d ",i);
                if(visit[i-1]==true)
                {
                        //count--;
                        z++;
                        //printf("\n");
                        for(j=k;visit[j]==true && j<n;j++)
                        i=j+2,k=j;
                        }               
        }
        
        for(i=0;i<n;i++)
        visit[i]=false;
        i=1;k=0,count=0;
        
        printf("%d\n",z);
        printf("%d ",i);
        
        while(count!=n)
        {
                visit[i-1]=true;
                i=p[i-1][0];count++;
                printf("%d ",i);
                if(visit[i-1]==true)
                {
                        //count--;
                        z++;
                        printf("\n");
                        for(j=k;visit[j]==true && j<n;j++)
                        i=j+2,k=j;
                        if(count<n)
                        printf("%d ",i);
                }
        }
}