Pagini recente » Cod sursa (job #2176363) | Cod sursa (job #2684897) | Cod sursa (job #1757080) | Cod sursa (job #1098756) | Cod sursa (job #1039103)
#include <cstdio>
#include <vector>
using namespace std;
vector <int> g[100005],gt[100005],post_ordine,ctc[100005];
int viz[100005],nr,n,m,x,y,h[100005],h1[100005];
void dfs(int vf)
{
viz[vf]=1;
for(int i=0;i<h[vf];i++)
{
if(!viz[g[vf][i]])
dfs(g[vf][i]);
}
post_ordine.push_back(vf);
}
void dfst(int vf)
{
viz[vf]=0;
ctc[nr].push_back(vf);
for(int i=0;i<h1[vf];i++)
{
if(viz[gt[vf][i]])
dfst(gt[vf][i]);
}
}
int main()
{
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
g[x].push_back(y);
h[x]++;
gt[y].push_back(x);
h1[y]++;
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
dfs(i);
}
}
for(int i=post_ordine.size()-1;i>=0;i--)
{
if(viz[post_ordine[i]])
{
nr++;
dfst(post_ordine[i]);
}
}
printf("%d\n",nr);
for(int i=1;i<=nr;i++)
{
int nr2=ctc[i].size();
for(int j=0;j<nr2;j++)
{
printf("%d ",ctc[i][j]);
}
printf("\n");
}
return 0;
}