Pagini recente » Cod sursa (job #96724) | Istoria paginii runda/plictiseala/clasament | Cod sursa (job #1134038) | Cod sursa (job #2487008) | Cod sursa (job #1129946)
#include<fstream>
#include<vector>
#include<cstring>
#include<stack>
#define NMAX 100005
#define VEC G[nod][i]
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,nr;
vector<int> G[NMAX],GT[NMAX],ctc[NMAX];
stack<int> S;
bool use[NMAX];
void read()
{
fin>>n>>m;
for(int i=1,x,y;i<=m;i++)
{
fin>>x>>y;
G[x].push_back(y);
GT[y].push_back(x);
}
}
void DFSp(int nod,vector<int> *G)
{
use[nod]=1;
for(size_t i=0;i<G[nod].size();i++)
if(!use[VEC])
DFSp(VEC,G);
S.push(nod);
}
void DFSm(int nod,vector<int> *G)
{
use[nod]=1;
ctc[nr].push_back(nod);
for(size_t i=0;i<G[nod].size();i++)
if(!use[VEC])
DFSm(VEC,G);
}
int main()
{
read();
for(int i=1;i<=n;i++)
if(!use[i])
DFSp(i,G);
memset(use,0,sizeof use);
for(;S.size();S.pop())
if(!use[S.top()])
{
nr++;
DFSm(S.top(),GT);
}
fout<<nr<<'\n';
for(int i=1;i<=nr;i++)
{
for(size_t j=0;j<ctc[i].size();j++)
fout<<ctc[i][j]<<' ';
fout<<'\n';
}
return 0;
}