Pagini recente » Cod sursa (job #2575265) | Cod sursa (job #2387825) | Cod sursa (job #713243) | Rating Filip Rares (filiprares) | Cod sursa (job #1644123)
#include <cstdio>
#include <vector>
using namespace std;
vector<vector<int> > sol;
vector<int> v[100010],vt[100010];
int q[100010],nr;
char vaz[100010];
void dfs1(int nod)
{
vaz[nod]=1;
for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
if(!vaz[*it]) dfs1(*it);
q[++nr]=nod;
}
void dfs2(int nod,vector<int> &sol)
{
vaz[nod]=0;
sol.push_back(nod);
for(vector<int>::iterator it=vt[nod].begin();it!=vt[nod].end();it++)
if(vaz[*it]) dfs2(*it,sol);
}
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]) dfs1(i);
for(int i=nr;i;i--)
if(vaz[q[i]])
{
vector<int> aux;
dfs2(q[i],aux);
sol.push_back(aux);
}
printf("%d\n",sol.size());
for(int i=0;i<sol.size();i++)
{
for(int j=0;j<sol[i].size();j++) printf("%d ",sol[i][j]);
printf("\n");
}
return 0;
}