Cod sursa(job #1896066)

Utilizator IoanaBacrauIoana Georgiana Bacrau IoanaBacrau Data 28 februarie 2017 13:36:44
Problema Componente tare conexe Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
#include <fstream>
#include <vector>

using namespace std;

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

#define NMAX 100002

vector<int> G[NMAX];
vector<int> Gt[NMAX];
vector<int> CTC[NMAX];
int vf[NMAX];
int poz, nr;

int N, M;
int postordine[NMAX];

void citire()
{
    int i, x, y;
    fin >> N >> M;
    for(i=0; i<M; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
        Gt[y].push_back(x);
    }
}

void DFS(int x)
{
    int i, lg;
    vf[x]=1;
    lg= G[x].size();
    for(i=0; i<lg; i++)
    {
        if(!vf[G[x][i]])
            DFS(G[x][i]);
    }
    postordine[++poz]=x;
}


void DFST(int x)
{
    int i, lg;
    CTC[nr].push_back(x);
    vf[x]=0;
    lg= Gt[x].size();
    for(i=0; i<lg; i++)
    {
        if(vf[Gt[x][i]])
            DFST(Gt[x][i]);
    }
}

void afisare()
{
    int i, j;
    fout << nr << '\n';
    for(i=1; i<=nr; i++)
    {
        for(j=0; j<CTC[i].size(); j++)
            fout << CTC[i][j] << ' ';
        fout << '\n';
    }
}

int main()
{
    citire();
    int i;
    for(i=1; i<=N; i++)
    {
        if(!vf[i]) DFS(i);
    }
    for(i=N; i>0; i--)
    {
        if(vf[postordine[i]])
        {
            nr++;
            DFST(postordine[i]);
        }
    }
    return 0;
}