Pagini recente » Cod sursa (job #1475493) | Cod sursa (job #1130483) | Cod sursa (job #2872406) | Cod sursa (job #2203506) | Cod sursa (job #1251343)
#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;
ifstream fin ("ctc.in");
ofstream fout ("ctc.out");
vector <int> G[NMAX],GT[NMAX],sol[NMAX];
int uz[NMAX], postord[NMAX];
int n, m, lg, ctc;
void citire();
void dfsG(int);
void dfsGT(int);
void afisare();
int main()
{
int i, j;
citire();
for (i=1; i<=n; ++i)
if (uz[i]==0)
dfsG(i);
for(i=1; i<=n; i++)
uz[i]=0;
for(i=n; i>=1; i--)
if(uz[postord[i]]==0)
{
ctc++;
dfsGT(postord[i]);
}
afisare();
return 0;
}
void citire()
{
int x,y,i;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
G[x].push_back(y);
GT[y].push_back(x);
}
}
void dfsG(int k)
{
int i;
uz[k]=1;
for (i=0; i<G[k].size(); i++)
if (uz[G[k][i]]==0)
dfsG(G[k][i]);
postord[++lg]=k;
}
void dfsGT(int k)
{
int i;
uz[k]=1;
sol[ctc].push_back(k);
for (i=0; i<GT[k].size(); i++)
if (uz[GT[k][i]]==0)
dfsGT(GT[k][i]);
}
void afisare()
{
int i,j;
fout<<ctc<<'\n';
for(i=1;i<=ctc;i++)
{
for(j=0;j<sol[i].size();j++)
fout<<sol[i][j]<<' ';
fout<<'\n';
}
}