Cod sursa(job #1487695)

Utilizator sorynsooSorin Soo sorynsoo Data 17 septembrie 2015 11:38:51
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include <fstream>
#include <stack>
#include <vector>
using namespace std;
#define MAXN 100005
ifstream cin("ctc.in");
ofstream cout("ctc.out");

vector<int> graf[MAXN],graf2[MAXN],ctc[MAXN];
stack<int> st;
int n,m,i,j,x,y,nr_ctc,nod;
bool viz[MAXN];

void dfs_1(int nod)
{
    for(int i=0; i<graf[nod].size(); i++)
        if(!viz[graf[nod][i]])
        {
            viz[graf[nod][i]]=true;
            dfs_1(graf[nod][i]);
        }
    st.push(nod);
}

void dfs_2(int nod)
{
    for(int i=0; i<graf2[nod].size(); i++)
        if(!viz[graf2[nod][i]])
        {
            viz[graf2[nod][i]]=true;
            dfs_2(graf2[nod][i]);
        }
    ctc[nr_ctc].push_back(nod);
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
        graf2[y].push_back(x);
    }

    for(i=1; i<=n; i++)
        if(!viz[i])
        {
            viz[i]=true;
            dfs_1(i);
        }

    for(i=1; i<=n; i++)
        viz[i]=false;

    while(!st.empty())
    {
        nod=st.top(); st.pop();
        if(viz[nod])
            continue;

        viz[nod]=true;
        nr_ctc++;
        dfs_2(nod);
    }

    cout<<nr_ctc<<"\n";
    for(i=1; i<=nr_ctc; i++)
    {
        for(j=0; j<ctc[i].size(); j++)
            cout<<ctc[i][j]<<" ";
        cout<<"\n";
    }

}