Cod sursa(job #2153705)

Utilizator AndreidgDragomir Andrei Valentin Andreidg Data 6 martie 2018 13:50:53
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.47 kb
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
const int N = 100005;
ifstream f("ctc.in");
ofstream g("ctc.out");

vector <int> V[N];
vector <int> Tr[N];
vector <int> sol[N];
bool viz[N];
bool minuss[N];
int stiva[N];
int n,m,k,nr;

void dfs(int poz){

    int sz = V[poz].size();
    for(int i = 0 ; i< sz; i++){

        int nx = V[poz][i];
        if(viz[nx]==0)
        {
            viz[nx] = 1;
            dfs(nx);
        }
    }
    k++;
    stiva[k] = poz;
}

void dfs2(int poz){

    int sz = Tr[poz].size();
    for(int i = 0 ; i< sz; i++){

        int nx = Tr[poz][i];
        if(minuss[nx]==0)
        {
            minuss[nx] = 1;
            dfs2(nx);
        }
    }
    sol[nr].push_back(poz);
}
int main()
{
    f>>n>>m;
    for(int i = 1; i<= m; i++)
    {
        int x,y;
        f>>x>>y;
        V[x].push_back(y);
        Tr[y].push_back(x);
    }

    for(int i = 1; i<= n; i++)
    {
        if(viz[i]==0){
            viz[i] = 1;
            dfs(i);
        }
    }

    for(int i = n; i>= 1; i--){

        if(minuss[stiva[i]]==0){

            minuss[stiva[i]]= 1;
            nr++;
            dfs2(stiva[i]);
        }
    }
    g<<nr<<"\n";
    for(int i =1 ; i<= nr; i++){

        int sz = sol[i].size();
        for(int j =0; j< sz; j++){
            g<<sol[i][j]<<" ";
        }

        g<<"\n";
    }
    f.close();
    g.close();
    return 0;
}