Pagini recente » Cod sursa (job #1141487) | Cod sursa (job #3134972) | Cod sursa (job #1469165) | Cod sursa (job #2475300) | Cod sursa (job #798089)
Cod sursa(job #798089)
#include <cstdio>
using namespace std;
int n,m;
struct nod{
int x;
nod *urm;
};
struct varf{
int viz;
nod *p;
nod *u;
}*a[1000000];
void adaugare_prim(int x,nod *&p,nod *&u)
{
p=new nod;
p->x=x;
p->urm=NULL;
u=p;
}
void adaugare_sf(int x,nod *&u)
{
nod *q=new nod;
q->x=x;
q->urm=NULL;
u->urm=q;
u=q;
}
void citire ()
{
freopen("dfs.in","r",stdin);
int x,y;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++){
a[i]=new varf;
a[i]->viz=0;
a[i]->p=NULL;
a[i]->u=NULL;
}
for(int i=0;i<m;i++)
{
scanf("%d %d",&x,&y);
if(!a[x]->p){
adaugare_prim(y,a[x]->p,a[x]->u);
}
else
adaugare_sf(y,a[x]->u);
}
}
nod *c,*uc;
void latime (int vf){
if(!c)
adaugare_prim(vf,c,uc);
else
adaugare_sf(vf,uc);
a[vf]->viz=1;
for(nod *i=c; i; i=i->urm){
int x=i->x;
for(nod *j=a[x]->p;j;j=j->urm){
if(a[j->x]->viz==0){
a[j->x]->viz=1;
adaugare_sf(j->x,uc);
}
}
}
}
void afisare ()
{
freopen("dfs.out","w",stdout);
int nr=0;
for(int i=1;i<=n;i++){
if(a[i]->viz==0){
latime(i);
nr++;
}
}
printf("%d\n",nr);
}
int main ()
{
citire();
afisare();
return 0;
}