843A - Sorting by Subsequences - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
int main(){


        int n , temp;
        cin>>n;

        vector<pair<long long int,int>>vec(n);
        int arr[n]={0};

        for(int x=0;x<n;x++){

            cin>>temp;

            vec[x] = {temp , x};
        }

        sort(vec.begin(),vec.end());

        for(int x=0;x<n;x++){

            int h = vec[x].second;

            arr[h] = x;
        }

        vector<vector<int>>ans;
        vector<int>tmp;

        int visited[n]={0};

        for(int x=0;x<n;x++){
  
            if(visited[x]==0){

                if(arr[x]==x){

                    vector<int>k;

                    visited[x] = 1;

                    k.push_back(x+1);
                    ans.push_back(k);

                }else{

                    int l = x;

                    while(visited[arr[l]]!=1){

                        tmp.push_back(arr[l]+1);

                        visited[arr[l]]=1;

                        l = arr[l];
                        

                    }

                    ans.push_back(tmp);
                    tmp.clear();

                }
            }
            

        }

        cout<<ans.size()<<endl;

        for(auto z:ans){

            cout<<z.size()<<" ";

            for(auto y:z){
                cout<<y<<" ";
            }
            cout<<'\n';
        }    


    return 0;
}