Pagini recente » Cod sursa (job #342031) | Cod sursa (job #731450) | Cod sursa (job #2756126) | Cod sursa (job #857775) | Cod sursa (job #2433834)
#include <bits/stdc++.h>
#define NMAX 100009
#define MMAX 200009
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,nrc;
bool uz[NMAX];
stack <int> h;
vector <int>g[NMAX];
vector <int>gt[NMAX];
vector <int> sol[NMAX];
int nrs;
void citire();
void dfs(int k);
void dfs1(int k);
int main()
{citire();
for(int i=1;i<=n;i++)
if(!uz[i])
nrc++, dfs(i);
memset(uz,0,sizeof(uz));
while(!h.empty())
{
int el=h.top();h.pop();
if(!uz[el])
{
nrs++;dfs1(el);
}
}
fout<<nrs<<'\n';
for(int i=1;i<=nrs;i++)
{
for(int j=0;j<sol[i].size();j++)
fout<<sol[i][j]<<" ";
fout<<'\n';
}
return 0;
}
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);
}
}
void dfs(int k)
{
uz[k]=nrc;h.push(k);
int i;
for(i=0;i<g[k].size();i++)
if(!uz[g[k][i]])
dfs(g[k][i]);
}
void dfs1(int k)
{
int i;
uz[k]=nrs;
sol[nrs].push_back(k);
for(i=0;i<gt[k].size();i++)
if(!uz[gt[k][i]])
dfs1(gt[k][i]);
}