Pagini recente » Cod sursa (job #2159144) | Cod sursa (job #1620977) | Cod sursa (job #1832730) | Cod sursa (job #2774809) | Cod sursa (job #2340033)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector <int> L[50001], M[50001], CTC[50001];
int S1[50001];
int n, m;
void Citire()
{ int i, x, y;
f>>n>>m;
for(i=1;i<=m;i++)
{ f>>x>>y;
L[x].push_back(y);
M[y].push_back(x);
}
}
void DFS(int k)
{ S1[k]=1;
int j;
for(j=0;j<L[k].size();j++)
if(S1[L[k][j]]==0)
DFS(L[k][j]);
}
void DFS2(int k)
{ S1[k]=2;
int j;
for(j=0;j<M[k].size();j++)
if(S1[M[k][j]]==1)
DFS2(M[k][j]);
}
void Afisare(int nr)
{int i, j;
g<<nr<<endl;
for(i=1;i<=nr;i++)
{for(j=0;j<CTC[i].size();j++)
g<<CTC[i][j]<<" ";
g<<'\n';}
}
int main()
{int i,nrc=0,j;
Citire();
for(i=1;i<=n;i++)
if(S1[i]==0)
{ nrc++;
DFS(i);
DFS2(i);
for(j=1;j<=n;j++)
{if(S1[j]==2)
{CTC[nrc].push_back(j); S1[j]=-1;}
if(S1[j]==1)
S1[j]=0;}
}
Afisare(nrc);
f.close();
g.close();
return 0;
}