Pagini recente » Cod sursa (job #1328408) | Cod sursa (job #2427586) | Cod sursa (job #850242) | Cod sursa (job #1249051) | Cod sursa (job #2333983)
#include <bits/stdc++.h>
using namespace std;
struct nod{
int inf;
nod *urm;
}*l[100010],*l2[100010],*r[100010],*aux;
int n,nr,sol[100010],viz[100010],m,t;
void df(int x){
nod *i;
viz[x]=1;
for (i=l[x];i!=NULL;i=i->urm){
if (!viz[i->inf]){
df(i->inf);
}
}
sol[--nr]=x;
}
void df2(int x){
nod *i;
viz[x]=1;
for (i=l2[x];i!=NULL;i=i->urm){
if (!viz[i->inf]){
df2(i->inf);
}
}
aux = new nod;
aux->urm=r[t];
aux->inf=x;
r[t]=aux;
}
int main()
{
int i,x,y;
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=m;i++){
scanf("%d%d",&x,&y);
aux = new nod;
aux->urm=l[x];
aux->inf=y;
l[x]=aux;
aux = new nod;
aux->urm=l2[y];
aux->inf=x;
l2[y]=aux;
}
nr=n+1;
df(1);
t=0;
memset(viz,0,sizeof(viz));
for (i=1;i<=n;i++)
if (!viz[sol[i]]) {
t++;
df2(sol[i]);
}
printf("%d\n",t);
for (i=1;i<=t;i++){
nod *j;
for (j=r[i];j!=NULL;j=j->urm)
printf("%d ",j->inf);
printf("\n");
}
return 0;
}