Cod sursa(job #2375790)

Utilizator serbandonceanSerban Doncean serbandoncean Data 8 martie 2019 12:11:22
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include <bits/stdc++.h>
#define DMAX 100002
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
void citire();
vector<int> g[DMAX];
vector<int> afis[DMAX];
int da[DMAX],s[DMAX];
int lg,m,n,nr;
void dfs(int k);
void dfs1(int k);
void reset();
vector<int> gt[DMAX];
int main()
{int i,j;
    citire();
    for(i=1;i<=n;i++)
        if(!da[i])
        dfs(i);
    reset();
    while(lg)
    {   //cout<<da[s[lg]]<<' '<<lg<<'\n';
        if(!da[s[lg]])
            nr++,dfs1(s[lg]);
        lg--;

    }
    fout<<nr<<'\n';
    for(i=1;i<=nr;i++)
        {for(j=0;j<afis[i].size();j++)
            fout<<afis[i][j]<<' ';
        fout<<'\n';
        }
}
void citire()
{int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {fin>>x>>y;
    g[x].push_back(y);
    gt[y].push_back(x);
    }
}
void dfs(int k)
{int i;
    da[k]=1;
    for(i=0;i<g[k].size();i++)
        if(!da[g[k][i]])
            dfs(g[k][i]);
    s[++lg]=k;

}
void reset()
{int i;
    for(i=1;i<=n;i++)
        da[i]=0;
}
void dfs1(int k)
{int i;
    da[k]=nr;
    afis[nr].push_back(k);

    for(i=0;i<gt[k].size();i++)
        if(!da[gt[k][i]])
            dfs1(gt[k][i]);


}