Pagini recente » Cod sursa (job #1667774) | Cod sursa (job #2492734) | Cod sursa (job #730922) | Cod sursa (job #1158590) | Cod sursa (job #1537374)
#include <iostream>
#include <vector>
#include <stack>
#include <stdio.h>
#define NMax 100002
using namespace std;
vector<int> Graf[NMax],GrafT[NMax],Sol[NMax];
int Com[NMax],N,M,Nrcom;
bool mark[NMax];
stack<int> Stiva;
void Read()
{
scanf("%d%d",&N,&M);
for(int i=1;i<=M;i++)
{
int x,y;
scanf("%d%d",&x,&y);
Graf[x].push_back(y);
GrafT[y].push_back(x);
}
}
void DFS1(int nod)
{
mark[nod]=true;
for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
if(mark[*it]==false)
DFS1(*it);
Stiva.push(nod);
}
void DFS2(int nod)
{
Com[nod]=Nrcom;
Sol[Nrcom].push_back(nod);
for(vector<int>::iterator it=GrafT[nod].begin();it!=GrafT[nod].end();it++)
if(Com[*it]==0)
DFS2(*it);
}
void Kosaraju()
{
for(int i=1;i<=N;i++)
if(mark[i]==false)
DFS1(i);
while(Stiva.empty()==false)
{
if(Com[Stiva.top()]==0)
{
Nrcom++;
DFS2(Stiva.top());
}
Stiva.pop();
}
}
void Write()
{
printf("%d\n",Nrcom);
for(int i=1;i<=Nrcom;i++)
{
for(vector<int>::iterator it=Sol[i].begin();it!=Sol[i].end();it++)
printf("%d ",*it);
printf("\n");
}
}
int main()
{
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
Read();
Kosaraju();
Write();
}