Pagini recente » Cod sursa (job #2422183) | Cod sursa (job #2530741) | Cod sursa (job #2262117) | Cod sursa (job #2595819) | Cod sursa (job #1107607)
#include <stdio.h>
#include <vector>
#define NMax 100002
using namespace std;
vector<int> G[NMax];
vector<int> GT[NMax];
vector<int> Sol[NMax];
int viz[NMax];
int vizt[NMax];
int fin[NMax];
int st[NMax];
int n,m,k,q,nr;
void citire()
{
int i,x,y;
freopen("ctc.in","r",stdin);
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
G[x].push_back(y);
GT[y].push_back(x);
}
fclose(stdin);
}
int dfs(int x)
{
vector<int>::iterator it;
viz[x]=1;
for(it=G[x].begin();it!=G[x].end();it++)
{
if(!viz[*it]) dfs(*it);
}
fin[++k]=x;
}
int dfst(int x)
{
vector<int>::iterator it;
vizt[x]=1;
Sol[nr].push_back(x);
for(it=GT[x].begin();it!=GT[x].end();it++)
{
if(!vizt[*it]) {Sol[q].push_back(*it); dfst(*it);}
}
}
int main()
{
int i;
freopen("ctc.out","w",stdout);
citire();
for(i=1;i<=n;i++)
{
if(!viz[i]) dfs(i);
}
for(i=k;i>=1;i--)
{
if(!vizt[fin[i]]){nr++; dfst(fin[i]); }
}
vector<int>::iterator it;
printf("%d",nr);
for(i=1;i<=nr;i++)
{
for(it=Sol[i].begin();it!=Sol[i].end();it++)
{
printf("%d ",*it);
}
printf("\n");
}
fclose(stdout);
return 0;
}