Pagini recente » Cod sursa (job #2437941) | Cod sursa (job #605866) | Cod sursa (job #1384428) | Cod sursa (job #1223046) | Cod sursa (job #3227639)
#include <fstream>
#include <vector>
#define dim 100001
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector <int> l[dim], g[dim], sol[dim];
int viz[dim], a[dim], k, cnx;
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<l[nod].size();i++)
{
int vecin=l[nod][i];
if(viz[vecin]==0)
{
dfs(vecin);
}
}
a[++k]=nod;
}
void dfs2(int nod)
{
viz[nod]=cnx;
for(int i=0;i<g[nod].size();i++)
{
int vecin=g[nod][i];
if(viz[vecin]==0)
{
dfs2(vecin);
}
}
sol[cnx].push_back(nod);
}
int main()
{
int n, m, i, j, x, y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
l[x].push_back(y);
g[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
}
}
for(i=1;i<=n;i++)
{
viz[i]=0;
}
for(i=n;i>=1;i--)
{
if(viz[a[i]]==0)
{
cnx++;
dfs2(a[i]);
}
}
fout<<cnx<<"\n";
for(i=1;i<=cnx;i++)
{
for(j=0;j<sol[i].size();j++)
{
fout<<sol[i][j]<<" ";
}
fout<<"\n";
}
}