Pagini recente » Cod sursa (job #328477) | Cod sursa (job #1850084) | Cod sursa (job #1430675) | Rating visuian mihai (visuianmihai1) | Cod sursa (job #1735352)
#include <cstdio>
#include <vector>
using namespace std;
int nr,c,vaz[100010],v1[100010];
vector<int> v[100010];
vector<int> vt[100010];
vector<int> r[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]);
v1[++nr]=nod;
}
void dfs1(int nod)
{
vaz[nod]=0;
r[c].push_back(nod);
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=nr;i>=1;i--)
if(vaz[v1[i]]==1)
{
c++;
dfs1(v1[i]);
}
printf("%d\n",c);
for(int i=1;i<=c;i++)
{
for(int j=0;j<r[i].size();j++)
printf("%d ",r[i][j]);
printf("\n");
}
return 0;
}