Pagini recente » Cod sursa (job #346117) | Cod sursa (job #800125) | Cod sursa (job #2921278) | Cod sursa (job #1025722) | Cod sursa (job #2175733)
#include <cstdio>
#include <vector>
using namespace std;
int l,q[100010],nr;
char vaz[100010];
vector<int> v[100010],vt[100010],ctc[100010];
void dfs(int nod)
{
vaz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(vaz[v[nod][i]]==0) dfs(v[nod][i]);
q[++l]=nod;
}
void dfs1(int nod)
{
ctc[nr].push_back(nod);
vaz[nod]=0;
for(int i=0;i<vt[nod].size();i++)
if(vaz[vt[nod][i]]==1) dfs1(vt[nod][i]);
}
int main()
{
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
int n,m,x,y;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
v[x].push_back(y);
vt[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(vaz[i]==0) dfs(i);
for(int i=l;i>=1;i--)
if(vaz[q[i]]==1)
{
nr++;
dfs1(q[i]);
}
printf("%d\n",nr);
for(int i=1;i<=nr;i++)
{
for(int j=0;j<ctc[i].size();j++) printf("%d ",ctc[i][j]);
printf("\n");
}
return 0;
}