Cod sursa(job #3375926)

Utilizator mlupseLupse-Turpan Mircea mlupse Data 14 noiembrie 2026 13:12:41
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.24 kb
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
const int NMax = 100000;
vector <int> G[NMax + 5],GT[NMax + 5];
vector<int> CTC[NMax + 5];
int N,M,NrCTC;
int Use[NMax + 5],TopoSort[NMax + 5],K;
void Read()
{
    fin >> N >> M;
    for(int i = 1; i <= M; ++i)
    {
        int x,y;
        fin >> x >> y;
        G[x].push_back(y);
        GT[y].push_back(x);
    }
}

void DFS_TopoSort(int Nod)
{
    Use[Nod] = 1;
    for(auto Vecin : G[Nod])
    if(Use[Vecin] == 0)
        DFS_TopoSort(Vecin);
    TopoSort[++K] = Nod;
}

void DFS(int Nod)
{
    Use[Nod] = 0; CTC[NrCTC].push_back(Nod);
    for(auto Vecin : GT[Nod])
    if(Use[Vecin] == 1)
        DFS(Vecin);
}

void Print()
{
    fout << NrCTC << "\n";
    for(int i = 1; i <= NrCTC; ++i)
    {
        for(auto Nod : CTC[i])
            fout << Nod << " ";
        fout << "\n";
    }
}

int main()
{
    Read();

    for(int i = 1; i <= N; ++i)
        if(!Use[i])
            DFS_TopoSort(i);

    for(int k = N ; k >= 1; --k)
    {
        int i = TopoSort[k];
        if(Use[i] == 1)
        {
            NrCTC++;
            DFS(i);
        }
    }
    Print();
    return 0;
}