Cod sursa(job #1107845)

Utilizator HDT_TibiHudema Dumitru Tiberiu HDT_Tibi Data 14 februarie 2014 14:49:56
Problema Componente tare conexe Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
#include <iostream>
#include <cstdio>
using namespace std;
  

  
struct Nod{int inf; Nod* leg;};
typedef Nod* nod;
  
nod a[100001],b[100001],s,c[100002];
  
int n,m,k;
bool viz[100001],viz2[100001];
void afisare(nod q)
{
    if(q){cout<<q->inf<<" "; afisare(q->leg);}
    else cout<<endl;
}
  
void adaug(nod &q, int x)
{
    nod p=new Nod;
    p->inf=x;
    p->leg=q;
    q=p;
}
  
void parc(int i)
{
    nod j;
    viz[i]=1;
    for(j=a[i]; j; j=j->leg) 
       if (!viz[j->inf])
         parc(j->inf);
    adaug(s,i);
}
  
void parc2(int i)
{
    viz[i]=1;//
    adaug(c[k],i);
    for(nod j=b[i]; j; j=j->leg) if (!viz[j->inf]) parc2(j->inf);//
}
  
int main()
{
	freopen ("ctc.in","r",stdin);
	freopen ("ctc.out","w",stdout);
    int i,x,y;
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        adaug(a[x],y);
        adaug(b[y],x);
    }
    for(i=1; i<=n; i++)
        if(!viz[i])
            parc(i);
	for(i=1; i<=n; i++) viz[i]=0;
    while(s)
    {
        if (!viz[s->inf])//
        {
            k++;
            parc2(s->inf);
        } 
        s=s->leg;
    }
    cout<<k<<"\n";
    for(i=1; i<=k; i++)
       afisare(c[i]);
 
    return 0;
}