Pagini recente » Cod sursa (job #1554596) | Cod sursa (job #1971551) | Cod sursa (job #1554306) | Cod sursa (job #2786883) | Cod sursa (job #1896049)
#include <fstream>
#include <vector>
#define NMAX 100002
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<int> G[NMAX];
vector<int> GT[NMAX];
vector<int> CTC[NMAX];
int n, m, poz, i, nr;
int postordine[NMAX];
bool uz[NMAX];
void citire();
void DFS(int x);
void DFST(int x);
void afisare();
int main()
{
citire();
for(i = 1; i <= n; ++i)
{
if(!uz[i])
DFS(i);
}
for(i = n; i > 0; --i)
if(uz[postordine[i]])
{
nr++;
DFST(postordine[i]);
}
afisare();
return 0;
}
void citire()
{
int i, x, y;
fin >> n >> m;
for(i = 0; i < m; ++i)
{
fin >> x >> y;
G[x].push_back(y);
GT[y].push_back(x);
}
}
void DFS(int x)
{
int lg;
uz[x] = true;
for(i = 0; i < G[x].size(); ++i)
if(!uz[G[x][i]])
DFS(G[x][i]);
postordine[++poz] = x;
}
void DFST(int x)
{
int lg;
uz[x] = false;
CTC[nr].push_back(x);
for(i = 0; i < GT[x].size(); ++i)
if(uz[GT[x][i]])
DFST(GT[x][i]);
}
void afisare()
{
int i, j;
fout << nr << '\n';
for(i = 1; i <= nr; ++i)
{
for(j = 0; j < CTC[i].size(); ++j)
fout << CTC[i][j] << ' ';
fout << '\n';
}
}