Cod sursa(job #2109126)

Utilizator malina2109Malina Diaconescu malina2109 Data 19 ianuarie 2018 10:14:53
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector< int > a[100010];
vector<int> a1[100010];
vector<int> sol[100010];
bool *viz;
int *timp,nr,fin,n,m;
void dfs(int x)
{
    viz[x]=1;
    for(int i=0;i<a[x].size();i++)
    {
        int var=a[x][i];
        if(!viz[var])
        {
            viz[var]=1;
            dfs(var);
        }
    }
    timp[++nr]=x;
}
void dfstrans(int x)
{
    viz[x]=1;
    sol[fin].push_back(x);
    for(int i=0;i<a1[x].size();i++)
    {
        int var=a1[x][i];
        if(viz[var]==0)
        {
            dfstrans(var);
        }
    }
}
int main()
{
    f>>n>>m;
    timp=new int[n+1];
    viz=new bool[n+1];
    for(int i=1;i<=n;i++)
        viz[i]=0;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        a[x].push_back(y);
        a1[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
        dfs(i);
    for(int i=1;i<=n;i++)
        viz[i]=0;
    for(int i=n;i>=1;i--)
    {
        if(viz[timp[i]]==0)
            {fin++;dfstrans(timp[i]);}
    }
    g<<fin<<"\n";
    for(int i=1;i<=fin;i++)
    {
        for(int j=0;j<sol[i].size();j++)
            g<<sol[i][j]<<" ";
        g<<"\n";
    }
    return 0;
}