Pagini recente » Cod sursa (job #2329035) | Cod sursa (job #1996027) | Cod sursa (job #569604) | Cod sursa (job #2110115) | Cod sursa (job #1962027)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
#define nmax 100005
int n, m, st[nmax], k=0, nr=0;
bool viz[nmax]={0};
vector<int> g[nmax], gt[nmax], comp[nmax];
void citire()
{
int i, x, y;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
g[x].push_back(y);
gt[y].push_back(x);
}
fin.close();
}
void dfs(int nod)
{
vector<int>::iterator it;
st[++k]=nod;
viz[nod]=1;
for(it=g[nod].begin(); it!=g[nod].end(); it++)
if(!viz[*it])
dfs(*it);
}
void dfst(int nod)
{
vector<int>::iterator it;
viz[nod]=1;
comp[nr].push_back(nod);
for(it=gt[nod].begin(); it!=gt[nod].end(); it++)
if(!viz[*it])
dfst(*it);
}
int main()
{
int i;
vector<int>::iterator it;
citire();
for(i=1; i<=n; i++)
if(!viz[i])
dfs(i);
for(i=1; i<=n; i++)
viz[i]=0;
for(i=k; i>=1; i--)
if(!viz[st[i]])
{
nr++;
dfst(st[i]);
}
fout<<nr<<endl;
for(i=1; i<=nr; i++)
{
for(it=comp[i].begin(); it!=comp[i].end(); it++)
fout<<*it<<' ';
fout<<'\n';
}
fout.close();
return 0;
}