Pagini recente » Cod sursa (job #1842932) | Cod sursa (job #2768153) | Cod sursa (job #1316538) | Cod sursa (job #1607314) | Cod sursa (job #2357567)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,viz[100003],drum[100003],nr,nrsol;
vector<int>g[100003];
vector<int>gt[100003];
vector<int>sol[100003];
void dfs(int nod)
{
viz[nod]=1;
for(vector<int> :: iterator it=g[nod].begin();it!=g[nod].end();it++)
if(viz[*it]==0)
dfs(*it);
nr++;
drum[nr]=nod;
}
void dfst(int nod)
{
viz[nod]=0;
sol[nrsol].push_back(nod);
for(vector<int> :: iterator it=gt[nod].begin();it!=gt[nod].end();it++)
if(viz[*it])
dfst(*it);
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
g[x].push_back(y);
gt[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(int i=n;i>=1;i--)
if(viz[drum[i]])
{
nrsol++;
dfst(drum[i]);
}
fout<<nrsol<<'\n';
for(int i=1;i<=nrsol;i++)
{
for(vector<int> :: iterator it=sol[i].begin();it!=sol[i].end();it++)
fout<<*it<<" ";
fout<<'\n';
}
}