Pagini recente » Cod sursa (job #2440643) | Cod sursa (job #1395664) | Cod sursa (job #1517821) | Cod sursa (job #2354773) | Cod sursa (job #2957025)
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
struct comp
{
vector<int> noduri;
} c[100005];
stack <int> S;
vector <int> G[100005];
vector <int> G1[100005];
int n, m, viz[100005];
int nrc;
void cit()
{
f>>n>>m;
int x, y;
for (int i=0; i<m; i++)
{
f>>x>>y;
G[x].push_back(y);
G1[y].push_back(x);
}
}
void dfs(int k)
{
viz[k]=1;
for (auto i: G[k])
if (!viz[i])
dfs(i);
S.push(k);
}
void dfs_G1(int k, int nr)
{
viz[k]=2;
c[nrc].noduri.push_back(k);
for (auto i: G1[k])
if (viz[i]==1)
dfs_G1(i, nr);
}
void parc()
{
for (int i=1; i<=n; i++)
if (!viz[i])
dfs(i);
while (!S.empty())
{
if (viz[S.top()]==2)
{
S.pop();
continue;
}
dfs_G1(S.top(), nrc);
nrc++;
}
}
void afis()
{
g<<nrc<<"\n";
for (int i=0; i<nrc; i++)
{
for (auto j: c[i].noduri)
g<<j<<' ';
g<<"\n";
}
}
int main()
{
cit();
parc();
afis();
return 0;
}