Pagini recente » Cod sursa (job #2718404) | Cod sursa (job #308375) | Cod sursa (job #527546) | Cod sursa (job #2903083) | Cod sursa (job #2974485)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<int> vv;
int viz[100001];
vector <int> in[100001],out[100001];
vector <vector <int> > ras;
vector <int> ans;
int x,y,n,m;
void dfs1(int nod)
{
viz[nod]=1;
for(int i=0;i<out[nod].size();i++)
if(viz[out[nod][i]]==0)
dfs1(out[nod][i]);
vv.push_back(nod);
}
void dfs2(int nod)
{
viz[nod]=1;
ans.push_back(nod);
for(int i=0;i<in[nod].size();i++)
if(viz[in[nod][i]]==0)
dfs2(in[nod][i]);
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
out[x].push_back(y);
in[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
dfs1(i);
for(int i=1;i<=n;i++)
viz[i]=0;
for(int i=vv.size()-1;i>=0;i--)
if(viz[vv[i]]==0)
{
dfs2(vv[i]);
ras.push_back(ans);
ans.clear();
}
fout<<ras.size()<<'\n';
for(int i=0;i<ras.size();i++,fout<<'\n')
for(int j=0;j<ras[i].size();j++)
fout<<ras[i][j]<<' ';
return 0;
}