Cod sursa(job #1251340)

Utilizator diana.albuAlbu Diana diana.albu Data 29 octombrie 2014 12:24:12
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include <fstream>
#include <vector>
#define NMAX 100001

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

int n, m, i, j, k;
bool uz[NMAX], uzT[NMAX];

vector <int> G[NMAX], GT[NMAX];
vector <int> sol[NMAX], postordine;

void citire();
void DFS1(int poz);
void DFS2(int poz);

int main()
{
    citire();
    for(i = 1; i <= n; i++)
    {
        if(uz[i] == 0)
            DFS1(i);
    }
    for(i = n-1; i >= 0; i--)
    {
        if(uzT[postordine[i]] == 0)
        {
            k++;
            DFS2(postordine[i]);
        }
    }
    fout << k << '\n';
    for(i = 1; i <= k; i++)
    {
        for(j = 0; j < sol[i].size(); j++)
            fout << sol[i][j] << ' ';
        fout << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}

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

void DFS1(int poz)
{
    int i;
    uz[poz] = 1;
    for(i = 0; i < G[poz].size(); i++)
        if(uz[G[poz][i]] == 0)
            DFS1(G[poz][i]);
    postordine.push_back(poz);
}

void DFS2(int poz)
{
    int i;
    uzT[poz] = 1;
    sol[k].push_back(poz);
    for(i = 0; i < GT[poz].size(); i++)
        if(uzT[GT[poz][i]] == 0)
            DFS2(GT[poz][i]);
}