Pagini recente » Cod sursa (job #3198249) | Cod sursa (job #895901) | Cod sursa (job #2206053) | Cod sursa (job #161629) | Cod sursa (job #2981325)
#include <bits/stdc++.h>
#define NMAX 100008
using namespace std;
ifstream fin ("ctc.in");
ofstream fout ("ctc.out");
int n, m, cnt;
bool viz[NMAX];
vector <int> G[NMAX], GT[NMAX], postordine, ctc[NMAX];
void DFS(int nod);
void DFST(int nod);
int main()
{
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);
}
for (int i = 1; i <= n; i++)
if (!viz[i])
DFS(i);
for (int i = n-1; i >= 0; i--)
if (viz[postordine[i]])
{
cnt++;
DFST(postordine[i]);
}
fout << cnt << '\n';
for (int i = 1; i <= cnt; i++)
{
for (auto el : ctc[i])
fout << el << ' ';
fout << '\n';
}
return 0;
}
void DFS(int nod)
{
viz[nod] = 1;
for (auto el : G[nod])
if (!viz[el])
DFS(el);
postordine.push_back(nod);
}
void DFST(int nod)
{
ctc[cnt].push_back(nod);
viz[nod] = 0;
for (auto el : GT[nod])
if (viz[el])
DFST(el);
}