Cod sursa(job #3345395)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 9 martie 2026 14:22:34
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.47 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,viz[NMAX];
vector<int> graph[NMAX],graph_tr[NMAX],comp[NMAX];
stack<int> stiva;

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

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

void DFS1(int nod)
{
    viz[nod]=1;
    for(int i=0; i<graph[nod].size(); i++)
    {
        int next_nod=graph[nod][i];

        if(!viz[next_nod])
        {
            DFS1(next_nod);
        }
    }
    stiva.push(nod);
}

void DFS2(int nod)
{
    viz[nod]=0;
    comp[nrctc].push_back(nod);
    for(int i=0; i<graph_tr[nod].size(); i++)
    {
        int next_nod=graph_tr[nod][i];

        if(viz[next_nod])
        {
            DFS2(next_nod);
        }
    }
}

int main()
{
    citire();

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

    nrctc=0;
    while(!stiva.empty())
    {
        int nod=stiva.top();
        stiva.pop();
        if(viz[nod])
        {
            nrctc++;
            DFS2(nod);
        }
    }

    fout<< nrctc << "\n";

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

    return 0;
}