Cod sursa(job #2485717)

Utilizator MariusblockMoga Marius-Ioan Mariusblock Data 1 noiembrie 2019 22:12:49
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.23 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin("ctc.in");
ofstream fout("ctc.out");

const int Nmax = 100000;

vector<int> G[Nmax + 5];
vector<int> Gt[Nmax + 5];
vector<int> CCnx[Nmax + 5];
int viz[Nmax + 5];
int use[Nmax + 5];
int n,m,ctopo;
int TSORT[Nmax+5];

void DFS(int a){
    viz[a] = 1;
    for(int i = 0; i < G[a].size(); i++){
        if(!viz[G[a][i]]){
            DFS(G[a][i]);
        }
    }
    TSORT[++ctopo] = a;
}

void DFSt(int a,int k){
    use[a] = k;
    CCnx[k].push_back(a);
    for(int i = 0; i < Gt[a].size(); i++){
        if(!use[Gt[a][i]]){
            DFSt(Gt[a][i],k);
        }
    }
}

int main()
{
    int i,a1,a2,k = 1;
    fin>>n>>m;
    for(i = 1; i <= m; i++){
        fin>>a1>>a2;
        G[a1].push_back(a2);
        Gt[a2].push_back(a1);
    }

    for(i = 1; i <= n; i++){
        if(!viz[i]){
            DFS(i);
        }
    }
    k = 1;
    for(i = n; i >= 1; i--){
        if(use[TSORT[i]] == 0){
            DFSt(TSORT[i],k);
            k++;
        }
    }
    k--;
    fout<<k<<'\n';
    for(i = 1; i <= k; i++){
        for(auto j : CCnx[i]){
            fout<<j<<' ';
        }
        fout<<'\n';
    }
    return 0;
}