Pagini recente » Cod sursa (job #1686991) | Cod sursa (job #3138551) | Cod sursa (job #2845000) | Cod sursa (job #429490) | Cod sursa (job #3284151)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector <int> g[100002],g2[200001];
stack <int> stiva;
int ctc;
vector <int> rez[100002];
int viz[100002];
void dfs(int nod)
{
viz[nod]=1;
for(unsigned int i=0; i<g[nod].size(); i++)
{
int j=g[nod][i];
if(!viz[j])
{
dfs(j);
}
}
stiva.push(nod);
}
void dfs2(int nod)
{
viz[nod]=2;
rez[ctc].push_back(nod);
for(unsigned int i=0; i<g2[nod].size(); i++)
{
int j=g2[nod][i];
if(viz[j]==1)
{
dfs2(j);
}
}
}
int n,m,x,y;
int main()
{
fin>>n>>m;
for(int i=1; i<=m; i++)
{
fin>>x>>y;
g[x].push_back(y);
g2[y].push_back(x);
}
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
dfs(i);
}
}
while(!stiva.empty())
{
int nr=stiva.top();
if(viz[nr]==1)
{
ctc++;
dfs2(nr);
}
stiva.pop();
}
fout<<ctc<<endl;
for(int i=1; i<=ctc; i++)
{
for(int j=0;j<rez[i].size();j++)
{
fout<<rez[i][j]<<" ";
}
fout<<endl;
}
return 0;
}