Pagini recente » Cod sursa (job #2441369) | Cod sursa (job #2069138) | Cod sursa (job #1448259) | Cod sursa (job #495418) | Cod sursa (job #1250466)
#include <fstream>
#include <vector>
#define NMAX 100004
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n, m;
vector <int> G[NMAX];
vector <int> Gt[NMAX];
vector <int> C[NMAX];
int postordine[NMAX];
bool uz[NMAX], ctc[NMAX];
int ord, nrctc;
void citire();
void tareconex();
void DFS(int vf);
void DFST(int vf);
void afisare();
int main()
{
citire();
tareconex();
afisare();
return 0;
}
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 tareconex()
{
int i, j;
for(i=1;i<=n;i++)
if(!uz[i])
DFS(i);
for(i=n;i>0;i--)
if(!ctc[postordine[i]])
{
++nrctc;
DFST(postordine[i]);
}
}
void DFS(int vf)
{
int i, j;
uz[vf]=1;
j=G[vf].size();
for(i=0;i<j;i++)
if(!uz[G[vf][i]])
DFS(G[vf][i]);
postordine[++ord]=vf;
}
void DFST(int vf)
{
int i, j;
ctc[vf]=1;
C[nrctc].push_back(vf);
j=Gt[vf].size();
for(i=0;i<j;i++)
if(!ctc[Gt[vf][i]])
DFST(Gt[vf][i]);
}
void afisare()
{
int i, j, k;
fout<<nrctc<<'\n';
for(i=1;i<=nrctc;i++)
{
k=C[i].size();
for(j=0;j<k;j++)
fout<<C[i][j]<<' ';
fout<<'\n';
}
}