Pagini recente » Cod sursa (job #2728205) | Cod sursa (job #619602) | Cod sursa (job #2938936) | Cod sursa (job #184886) | Cod sursa (job #1069561)
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
int st[100001],m,n,viz[100001],u,k;
vector<int> g[100001],gt[100001],sol[100001];
ifstream fin("ctc.in");
ofstream fout("ctc.out");
void citire()
{
int x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
g[x].push_back(y);
gt[y].push_back(x);
}
}
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<g[nod].size();i++)
{
if(viz[g[nod][i]]==0)
{
dfs(g[nod][i]);
st[++u]=g[nod][i];
}
}
}
void dfst(int nod)
{
viz[nod]=1;
sol[k].push_back(nod);
for(int i=0;i<gt[nod].size();i++)
{
if(viz[gt[nod][i]]==0)
{
dfst(gt[nod][i]);
}
}
}
void afisare()
{
fout<<k<<"\n";
for(int i=1;i<=k;i++)
{
for(int j=0;j<sol[i].size();j++)
fout<<sol[i][j]<<" ";
fout<<"\n";
}
}
int main()
{
citire();
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
st[++u]=i;
}
}
memset(viz,0,sizeof(viz));
while(u>0)
{
if(viz[st[u]]==0)
{
k++;
dfst(st[u]);
}
u--;
}
afisare();
return 0;
}