Cod sursa(job #3316787)

Utilizator andreea0146Nicula Andreea andreea0146 Data 20 octombrie 2025 21:58:46
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.35 kb
#include<iostream>
#include<fstream>
#include<vector>
#include<stack>
using namespace std;
const int NMAX=100000;

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

int n,m,nrc;

vector<int>g[NMAX+1],ctc[NMAX+1];
int d[NMAX+1], dmin[NMAX+1],timp=0;

stack<int>s;
bool inst[NMAX+1];

void citire()
{
    int x,y;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
}

void dfs(int x)
{
    d[x]=++timp;
    dmin[x]=d[x];
    s.push(x);
    inst[x]=1;
    for(auto &y:g[x])
    {
        if(d[y]==0)
        {
            dfs(y);
            dmin[x]=min(dmin[x],dmin[y]);
        }
        else
        {
            if(inst[y]==1)
                dmin[x]=min(dmin[x],d[y]);
        }
    }
    if(dmin[x]==d[x])
    {
        int u;
        nrc++;
        do
        {
            u=s.top();
            ctc[nrc].push_back(u);
            s.pop();
            inst[u]=0;
        }
        while(x!=u);
    }
}

void afisare()
{
    fout<<nrc<<'\n';
    for(int i=1; i<=nrc; i++)
    {
        for(auto &x:ctc[i])
            fout<<x<<' ';
        fout<<'\n';
    }
}

int main()
{
    citire();
    for(int i=1; i<=n; i++)
    {
        if(d[i]==0)
            dfs(i);
    }
    afisare();

    fin.close();
    fout.close();
    return 0;
}