Pagini recente » Cod sursa (job #1297658) | Cod sursa (job #1542724) | Cod sursa (job #2052990) | Cod sursa (job #879809) | Cod sursa (job #2073719)
#include <iostream>
#include <vector>
#include <cstdio>
#define N 100005
using namespace std;
int n, m, viz1[N], viz2[N], nr;
vector <int> graf1[N], graf2[N], a, sol[N];
void citire()
{
scanf("%d %d\n", &n, &m);
for(int i=1;i<=m;i++)
{
int x, y;
scanf("%d %d\n", &x, &y);
graf1[x].push_back(y);
graf2[y].push_back(x);
}
}
void dfs(int x)
{
viz1[x]=1;
for(int i=0;i<graf1[x].size();i++)
{
int nod=graf1[x][i];
if(!viz1[nod])
dfs(nod);
}
a.push_back(x);
}
void dfs_inv(int x)
{
viz2[x]=nr;
sol[nr].push_back(x);
for(int i=0;i<graf2[x].size();i++)
{
int nod=graf2[x][i];
if(!viz2[nod])
dfs_inv(nod);
}
}
void afisare()
{
for(int i=1;i<=nr;i++)
{
for(int j=0;j<sol[i].size();j++)
printf("%d ", sol[i][j]);
printf("\n");
}
}
int main()
{
freopen("ctc.in", "r", stdin);
freopen("ctc.out", "w", stdout);
citire();
for(int i=1;i<=n;i++)
if(!viz1[i])
dfs(i);
while(a.size())
{
if(!viz2[a.back()])
{
nr++;
dfs_inv(a.back());
}
a.pop_back();
}
printf("%d\n", nr);
afisare();
return 0;
}