Pagini recente » Cod sursa (job #25278) | Cod sursa (job #993373) | Cod sursa (job #2275815) | Cod sursa (job #426688) | Cod sursa (job #1740942)
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int viz[100001],viz1[100001],nrc,n,m,nr,postordine[100001];
int *a[100001],*aT[100001];
void dfs(int x)
{
int i;
viz[x]=1;
for(i=1;i<=a[x][0];i++)
{
if(viz[a[x][i]]==0)
{
dfs(a[x][i]);
}
}
nr++;
postordine[nr]=x;
}
void dfst(int x)
{
int i;
viz1[x]=nrc;
viz[x]=0;
for(i=1;i<=aT[x][0];i++)
{
if(viz[aT[x][i]]==1)
{
dfst(aT[x][i]);
}
}
}
int main()
{
int i,x,y,j;
ifstream f("ctc.in");
ofstream g("ctc.out");
f>>n>>m;
for(i=1;i<=n;i++)
{
a[i]=(int *)realloc(a[i],sizeof(int));
a[i][0]=0;
aT[i]=(int *)realloc(aT[i],sizeof(int));
aT[i][0]=0;
}
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][0]++;
a[x]=(int *)realloc(a[x],(a[x][0]+1)*sizeof(int));
a[x][a[x][0]]=y;
aT[y][0]++;
aT[y]=(int *)realloc(aT[y],(aT[y][0]+1)*sizeof(int));
aT[y][aT[y][0]]=x;
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
}
}
for(i=n;i>=1;i--)
{
if(viz[postordine[i]]==1)
{
nrc++;
dfst(postordine[i]);
}
}
g<<nrc<<"\n";
for(i=1;i<=nrc;i++)
{
for(j=1;j<=n;j++)
{
if(viz1[j]==i)
{
g<<j<<" ";
}
}
g<<"\n";
}
return 0;
}