Pagini recente » Cod sursa (job #728000) | Cod sursa (job #47212) | Borderou de evaluare (job #2247346) | Borderou de evaluare (job #1736983) | Cod sursa (job #2928903)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("ctc.in");
ofstream cout("ctc.out");
int n,m,ras,a[100005],nd[100005];
vector <int> v1[100005],v2[100005],sol[100005];
void dfs(int x)
{
a[x]=1;
for(int j=1; j<=v1[x][0]; j++)
{
int y = v1[x][j];
if(a[y]==0)
dfs(y);
}
nd[0]++;
nd[nd[0]]=x;
}
void dfs2(int x)
{
a[x]=0;
for(int j=1; j<=v2[x][0]; j++)
{
int y = v2[x][j];
if(a[y]==1)
dfs2(y);
}
sol[ras].push_back(x);
}
int main()
{
int x,y;
cin>>n>>m;
for(int i=1; i<=n; i++)
{
v1[i].push_back(0);
v2[i].push_back(0);
}
for(int i=1; i<=m; i++)
{
cin>>x>>y;
v1[x].push_back(y);
v1[x][0]++;
v2[y].push_back(x);
v2[y][0]++;
}
for(int i=1; i<=n; i++)
if(a[i]==0)
{
dfs(i);
}
for(int i=n; i>=1; i--)
if(a[nd[i]]==1)
{
ras++;
dfs2(nd[i]);
}
cout<<ras<<'\n';
for(int i=1; i<=ras; i++)
{
for(int j=0; j<sol[i].size(); j++)
{
cout<<sol[i][j]<<" ";
}
cout<<'\n';
}
return 0;
}