Pagini recente » Cod sursa (job #1794703) | Cod sursa (job #2513550) | Cod sursa (job #505464) | Cod sursa (job #2381854) | Cod sursa (job #2677461)
#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n, m, nrc;
int viz[Nmax];
int ctc[Nmax];
int post[Nmax];
int cnt;
vector<int>G[Nmax], GT[Nmax];
void DFS(int nod)
{
viz[nod]=1;
for(auto i:G[nod])
if(!viz[i])
DFS(i);
post[++cnt]=nod;
}
void DFST(int nod)
{
viz[nod]=0;
for(auto i:GT[nod])
if(viz[i])
DFST(i);
ctc[nod]=nrc;
}
void Kosaraju()
{
for(int i=1; i<=n; i++)
if(!viz[i])
DFS(i);
for(int i=n; i>=1; i--)
if(viz[post[i]])
{
nrc++;
DFST(post[i]);
}
}
int main()
{
fin>>n>>m;
while(m--)
{
int x, y;
fin>>x>>y;
G[x].push_back(y);
GT[y].push_back(x);
}
Kosaraju();
fout<<nrc<<'\n';
for(int i=1; i<=nrc; i++)
{
for(int j=1; j<=n; j++)
if(ctc[j]==i)
fout<<j<<" ";
fout<<'\n';
}
}