Pagini recente » Cod sursa (job #1731115) | Cod sursa (job #846929) | Cod sursa (job #2012423) | Cod sursa (job #2509809) | Cod sursa (job #1038356)
#include <fstream>
#include<cstdio>
#include <vector>
using namespace std;
FILE *in,*o;
int n,m,nr,ctc;
vector <int> G[100001];
vector <int> Gt[100001];
vector <int>M[100001];
int use[100001];
int pordine[100001];
void cit()
{
int i,x,y;
in=fopen("ctc.in","r");
fscanf(in,"%d%d",&n,&m);
for(i=1;i<=m;i++)
{
fscanf(in,"%d%d",&x,&y);
G[x].push_back(y);
Gt[y].push_back(x);
}
fclose(in);
}
void dfs(int vf)
{
int i,nra;
nra=G[vf].size();
use[vf]=1;
// nr+=pordine[nr];
for(i=0;i<nra;i++)
{
if(!use[G[vf][i]])
{
dfs(G[vf][i]);
}
}
pordine[++nr]=vf;
}
void dfst(int vf)
{
int i,nra;
nra=Gt[vf].size();
use[vf]=0;
M[ctc].push_back(vf);
for(i=0;i<nra;i++)
{
if(use[Gt[vf][i]])
dfst(Gt[vf][i]);
}
}
void afis()
{
int i,j,lg;
o=fopen("ctc.out","w");
fprintf(o,"%d",ctc);
fprintf(o,"%s","\n");
for(i=0;i<ctc;i++)
{
lg=M[i].size();
for(j=0;j<lg;j++)
{
fprintf(o,"%d ",M[i][j]);
}
fprintf(o,"%s","\n");
}
fclose(o);
}
int main()
{
int i;
cit();
nr=0;
for(i=1;i<=n;i++)
{
if(!use[i])
dfs(i);
}
for(i=n;i>=1;i--)
{
if(use[pordine[i]])
{
dfst(pordine[i]);
ctc++;
}
}
afis();
return 0;
}