Cod sursa(job #3336081)

Utilizator alexandra_popaa13Popa Alexandra alexandra_popaa13 Data 24 ianuarie 2026 09:59:49
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.25 kb
#include <bits/stdc++.h>
#define NMAX 1000002
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m;
vector<int> a[NMAX];
vector<int> ta[NMAX];
stack<int> st;
int viz[NMAX];
vector<int> ctc[NMAX];
int nr;

void citire();
void dfs1(int x);
void dfs2(int x);
int main()
{
    int i,j;
    citire();
    for(i=1; i<=n; i++)
        if(!viz[i])
            dfs1(i);
    for(i=1; i<=n; i++)
        viz[i]=0;
    while(!st.empty())
    {
        i=st.top();
        st.pop();
        if(!viz[i])
            {dfs2(i);
             nr++;
            }
    }

    fout<<nr<<'\n';
    for(i=0; i<nr; i++)
        {for(j=0; j<ctc[i].size(); j++)
            fout<<ctc[i][j]<<' ';
        fout<<'\n';}
    return 0;
}

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

void dfs1(int x)
{
    int i;
    viz[x]=1;
    for(i=0; i<a[x].size(); i++)
        if(!viz[a[x][i]])
            dfs1(a[x][i]);
    st.push(x);
}

void dfs2(int x)
{
    int i;
    viz[x]=1;
    ctc[nr].push_back(x);
    for(i=0; i<ta[x].size(); i++)
        if(!viz[ta[x][i]])
            dfs2(ta[x][i]);
}