Pagini recente » Cod sursa (job #403910) | Cod sursa (job #1397895) | Cod sursa (job #3000333) | Cod sursa (job #3229494) | Cod sursa (job #2195625)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n, m, k, q, rev[100002];
vector <int> a[100002];
vector <int> t[100002];
vector <int> ctc[100002];
bool d[100002];
void dfs1(int vf)
{
d[vf]=1;
for(unsigned int i=0; i<a[vf].size(); i++)
if(!d[a[vf][i]]) dfs1(a[vf][i]);
rev[++k]=vf;
}
void dfs2(int vf)
{
d[vf]=0;
ctc[q].push_back(vf);
for(unsigned int i=0; i<t[vf].size(); i++)
if(d[t[vf][i]]) dfs2(t[vf][i]);
}
int main()
{
int i, j;
fin>>n>>m;
while(m--)
{
fin>>i>>j;
a[i].push_back(j);
t[j].push_back(i);
}
for(i=1; i<=n; i++)
if(!d[i]) dfs1(i);
for(i=n; i>=1; i--)
if(d[rev[i]]==1)
{
q++;
dfs2(rev[i]);
}
fout<<q<<'\n';
for(i=1; i<=q; i++)
{
for(unsigned int f=0; f<ctc[i].size(); f++) fout<<ctc[i][f]<<' ';
fout<<'\n';
}
return 0;
}