Pagini recente » Cod sursa (job #108659) | Cod sursa (job #3146154) | Cod sursa (job #1895154) | Cod sursa (job #390245) | Cod sursa (job #1936958)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m,i,j,k,viz[100001],x,y,lista[100001],nr;
vector<int> to[100001],from[100001],ctc[100001];
void dfs(int nod)
{
int i;
for(i=0;i<to[nod].size();i++)
{
if(!viz[to[nod][i]])
{
viz[to[nod][i]]=1;
dfs(to[nod][i]);
}
}
lista[++nr]=nod;
}
void conex(int nod)
{
int i;
for(i=0;i<from[nod].size();i++)
{
if(!viz[from[nod][i]])
{
viz[from[nod][i]]=1;
conex(from[nod][i]);
}
}
ctc[nr].push_back(nod);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
to[x].push_back(y);
from[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!viz[i])
{
viz[i]=1;
dfs(i);
}
}
for(i=1;i<=n;i++) viz[i]=0;
nr=0;
for(i=n;i>=1;i--)
{
if(!viz[lista[i]])
{
viz[lista[i]]=1;
nr++;
conex(lista[i]);
}
}
g<<nr<<'\n';
for(i=1;i<=nr;i++)
{
for(j=0;j<ctc[i].size();j++) g<<ctc[i][j]<<' ';
g<<'\n';
}
return 0;
}