Cod sursa(job #1251353)

Utilizator AnaCucuAna Maria Cucu AnaCucu Data 29 octombrie 2014 12:32:53
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.25 kb
#include <fstream>
#include <vector>
#define NMAX 100001

using namespace std;

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

vector <int> gi[NMAX],gt[NMAX],sol[NMAX];
int uz[NMAX], post[NMAX];
int n, m, lg, comp;

void citire();
void dfs(int);
void dfst(int);

int main()
{
    int i, j;
    citire();
    for (i=1; i<=n; ++i)
        if (uz[i]==0)
            dfs(i);
    for(i=1; i<=n; i++)
        uz[i]=0;
    for(i=n; i>=1; i--)
        if(uz[post[i]]==0)
            {
            comp++;
            dfst(post[i]);
            }
    fout<<comp<<'\n';
    for(i=1;i<=comp;i++)
        {
        for(j=0;j<sol[i].size();j++)
            fout<<sol[i][j]<<' ';
        fout<<'\n';
        }
    return 0;
}
void citire()
{
    int x,y,i;
    fin>>n>>m;
    for(i=1; i<=m; i++)
        {
        fin>>x>>y;
        gi[x].push_back(y);
        gt[y].push_back(x);
        }
}
void dfs(int z)
{
    int i;
    uz[z]=1;
    for (i=0; i<gi[z].size(); i++)
        if (uz[gi[z][i]]==0)
            dfs(gi[z][i]);
    post[++lg]=z;
}
void dfst (int z)
{
    int i;
    uz[z]=1;
    sol[comp].push_back(z);
    for (i=0; i<gt[z].size(); i++)
        if (uz[gt[z][i]]==0)
            dfst(gt[z][i]);

}