Cod sursa(job #1125019)

Utilizator lianaliana tucar liana Data 26 februarie 2014 15:11:46
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.34 kb
#include<stdio.h>
#include<vector>
using namespace std;
#define nmax 100005
int n, m, i, x, y, tac, comp;
vector <int> ma[nmax], mat[nmax], vcomp[nmax];
vector <int> ::iterator it;
int viz[nmax], vordfcttpf[nmax];

void citire()
{
    scanf("%ld %ld",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld",&x,&y);
        ma[x].push_back(y);
        mat[y].push_back(x);
    }
}

void dfs1(int nod)
{
    vector <int> ::iterator it;
    viz[nod]=1;
    for (it=ma[nod].begin();it!=ma[nod].end();it++)
        if (!viz[*it])
            dfs1(*it);
    vordfcttpf[++tac]=nod;
}

void dfs2(int nod)
{
    vector <int> ::iterator it;
    viz[nod]=2; vcomp[comp].push_back(nod);
    for (it=mat[nod].begin();it!=mat[nod].end();it++)
        if (viz[*it]<2)
            dfs2(*it);
}

void afisare()
{
    printf("%ld\n",comp);
    for (i=1;i<=comp;i++)
    {
        for (it=vcomp[i].begin();it!=vcomp[i].end();it++)
            printf("%ld ",*it);
        printf("\n");
    }
}

int main()
{
    freopen("ctc.in","r",stdin);
    freopen("ctc.out","w",stdout);
    citire();
    for (i=1;i<=n;i++)
        if (!viz[i])
            dfs1(i);
    for (i=n;i>=1;i--)
        if (viz[vordfcttpf[i]]<2)
        {
            comp++;
            dfs2(vordfcttpf[i]);
        }
    afisare();
    return 0;
}