Pagini recente » Cod sursa (job #1375923) | Cod sursa (job #2625905) | Cod sursa (job #2081965) | Cod sursa (job #1833342) | Cod sursa (job #1250782)
#include <fstream>
#include <vector>
#define NMAX 10001
using namespace std;
ifstream fin ("ctc.in");
ofstream fout ("ctc.out");
vector <int> org[NMAX];
vector <int> trs[NMAX];
bool uz[NMAX];
int post[NMAX];
int n, m, lg, comp;
void citire();
void dfs_initial(int);
void dfs_transpus(int);
void afisare();
int main()
{
int i, j;
citire();
for (i=1; i<=n; ++i)
if (uz[i]==0)
dfs_initial(i);
for(i=1; i<=n; i++)
uz[i]=0;
for(i=n; i>=1; i--)
if(uz[post[i]]==0)
{
comp++;
dfs_transpus(post[i]);
}
afisare();
return 0;
}
void citire()
{
int x,y,i;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
org[x].push_back(y);
trs[y].push_back(x);
}
}
void dfs_initial (int k)
{
int i;
uz[k]=1;
for (i=0; i<org[k].size(); i++)
if (uz[org[k][i]]==0)
dfs_initial(org[k][i]);
post[++lg]=k;
}
void dfs_transpus (int k)
{
int i;
uz[k]=comp;
for (i=0; i<trs[k].size(); i++)
if (uz[trs[k][i]]==0)
dfs_transpus(trs[k][i]);
}
void afisare()
{
int i, j;
fout<<comp<<'\n';
for(i=1; i<=comp; i++)
{
for(j=1; j<=n; j++)
if(uz[j]==i)
fout<<j<<' ';
fout<<'\n';
}
}