Pagini recente » Rating Andrei Anusca (andreianusca) | Istoria paginii runda/simulareoni2011x2/clasament | Cod sursa (job #1772904) | Cod sursa (job #1223971) | Cod sursa (job #3258271)
#include <fstream>
#include <vector>
#define NMAX 100002
using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");
int n,nrc,poz=1;
vector <int> G[NMAX];
vector <int> GT[NMAX];
int postordine[NMAX];
vector <int> CTC[NMAX];
bool viz[NMAX];
void citire();
void afisare();
void DFS(int x);
void DFST(int x);
int main()
{
int i;
citire();
for(i=1;i<=n;i++)
{
if(!viz[i])
{
DFS(i);
}
}
for(i=n;i>=1;i--)
{
if(viz[postordine[i]]==1)
{
nrc++;
DFST(postordine[i]);
}
}
afisare();
return 0;
}
void citire()
{
int i,m,x,y;
in>>n>>m;
for(i=0;i<m;i++)
{
in>>x>>y;
G[x].push_back(y);
GT[y].push_back(x);
}
}
void afisare()
{
int i,j;
out<<nrc<<'\n';
for(i=1;i<=nrc;i++)
{
for(j=0;j<CTC[i].size();j++)
{
out<<CTC[i][j]<<' ';
}
out<<'\n';
}
}
void DFS(int x)
{
int i;
viz[x]=1;
for(i=0;i<G[x].size();i++)
{
if(!viz[G[x][i]])
{
DFS(G[x][i]);
}
}
postordine[poz++]=x;
}
void DFST(int x)
{
int i;
viz[x]=0;
CTC[nrc].push_back(x);
for(i=0;i<GT[x].size();i++)
{
if(viz[GT[x][i]])
{
DFST(GT[x][i]);
}
}
}