Pagini recente » Cod sursa (job #2788636) | Cod sursa (job #407707) | Cod sursa (job #1300649) | Cod sursa (job #1192800) | Cod sursa (job #2530673)
#include <bits/stdc++.h>
#define nmax 100003
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
bool viz[nmax];
vector<int> ctc[nmax];
vector<int> L[nmax],H[nmax];
int n,m,nrc;
int v[nmax],k;
void citire()
{
int x,y;
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
L[x].push_back(y);
H[y].push_back(x);
}
}
void DFS1(int nod)
{
viz[nod]=true;
for(auto i:L[nod])
if(!viz[i])
DFS1(i);
v[++k] = nod;
}
void DFS2(int nod)
{
viz[nod]=false;
for(auto i:H[nod])
if(viz[i])
DFS2(i);
ctc[nrc].push_back(nod);
}
void Kosaraju()
{
for(int i=1;i<=n;i++)
if(!viz[i])
DFS1(1);
for(int i=n;i>=1;i--)
if(viz[v[i]])
{
nrc++;
DFS2(v[i]);
}
}
void afisare()
{
g<<nrc<<'\n';
for(int i=1;i<=nrc;i++)
{
for(auto j:ctc[i])
{
g<<j<<' ';
}
g<<'\n';
}
}
int main()
{
citire();
Kosaraju();
afisare();
}