Pagini recente » Cod sursa (job #2242687) | Cod sursa (job #2215555) | Cod sursa (job #2081336) | Cod sursa (job #1353289) | Cod sursa (job #2080254)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");
const int Nmax = 100005;
int n, m, x, y, nr, k;
bool viz[Nmax];
int ordine[Nmax];
vector <int> A[Nmax], T[Nmax], rez[Nmax];
void DFS (int nod)
{
viz[nod] = 1;
for (auto i = 0; i < A[nod].size(); i++)
if (!viz[A[nod][i]])
{
ordine[++nr] = nod;
DFS(A[nod][i]);
}
}
void DFST (int nod)
{
viz[nod] = 0;
rez[nr].push_back(nod);
for (auto i = 0; i < T[nod].size(); i++)
if (viz[T[nod][i]])
DFST(T[nod][i]);
}
int main()
{
in >> n >> m;
for (int i = 1; i <= m; i++)
{
in >> x >> y;
A[x].push_back(y);
T[y].push_back(x);
}
nr = 1;
ordine[nr] = 1;
for (int i = 1; i <= n; i++)
if (!viz[i])
DFS(i);
nr = 0;
for (int i = 1; i <= n; i++)
if (viz[ordine[i]])
{
nr++;
k = 0;
DFST(ordine[i]);
}
out << nr << '\n';
for (int i = 1; i <= nr; i++)
{
for (auto j = 0; j < rez[i].size(); j++)
{
out << rez[i][j] << ' ';
}
out << '\n';
}
return 0;
}