Cod sursa(job #3310577)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 15 septembrie 2025 11:56:13
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.43 kb
#include <fstream>
#include <vector>
#include <stack>
#define NMAX 100002
using namespace std;
ifstream  fin("ctc.in");
ofstream fout("ctc.out");
int N,M,nrctc;
stack<int> stiva;
vector<int> viz(NMAX,0),sol[NMAX],graph[NMAX],graph_tr[NMAX];

void citire()
{
    fin>>N>>M;

    int a,b;
    for(int i=1; i<=M; i++)
    {
        fin>>a>>b;
        graph[a].push_back(b);
        graph_tr[b].push_back(a);
    }
}

void DFS(int nod)
{
    viz[nod]=1;
    for(int i=0; i<graph[nod].size(); i++)
    {
        if(!viz[graph[nod][i]])
        {
            DFS(graph[nod][i]);
        }
    }
    stiva.push(nod);
}

void DFST(int nod, int comp)
{
    viz[nod]=0;
    sol[comp].push_back(nod);

    for(int i=0; i<graph_tr[nod].size(); i++)
    {
        if(viz[graph_tr[nod][i]])
        {
            DFST(graph_tr[nod][i],comp);
        }
    }
}

int main()
{
    citire();

    for(int i=1; i<=N; i++)
    {
        if(!viz[i])
        {
            DFS(i);
        }
    }

    nrctc=0;
    while(!stiva.empty())
    {
        int nod=stiva.top();
        stiva.pop();

        if(viz[nod])
        {
            nrctc++;
            DFST(nod,nrctc);
        }
    }

    fout<< nrctc << "\n";

    for(int i=1; i<=nrctc; i++)
    {
        for(int j=0; j<sol[i].size(); j++)
        {
            fout<< sol[i][j] << " ";
        }
        fout<< "\n";
    }

    return 0;
}