Pagini recente » Cod sursa (job #2905152) | Cod sursa (job #624270) | Cod sursa (job #2416284) | Cod sursa (job #844910) | Cod sursa (job #1786339)
#include <cstdio>
#include <vector>
using namespace std;
int n,m,k;
int a[100005],viz[100005];
vector <int> graf[100004],vt[100004],ras[100004];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<graf[nod].size();i++)
if(viz[graf[nod][i]]==0)
dfs(graf[nod][i]);
a[++k]=nod;
}
void dfp(int nod)
{
viz[nod]=0;
ras[k].push_back(nod);
for(int i=0;i<vt[nod].size();i++)
if(viz[vt[nod][i]]==1)
dfp(vt[nod][i]);
}
int main()
{
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1,x,y;i<=m;i++)
{
scanf("%d%d",&x,&y);
graf[ x].push_back(y);
vt[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!viz[i])
dfs(i);
k=0;
for(int i=n;i>0;i--)
if(viz[a[i]])
{
k++;
dfp(a[i]);
}
printf("%d\n",k);
for(int i=1;i<=k;i++&&printf("\n"))
for(int j=0;j<ras[i].size();j++)
printf("%d ",ras[i][j]);
return 0;
}