Pagini recente » Monitorul de evaluare | Cod sursa (job #1704826) | Istoria paginii runda/lh10-2/clasament | Cod sursa (job #2304536) | Cod sursa (job #798104)
Cod sursa(job #798104)
#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 adaugare (int x,int y)
{
if(!a[x]->p)
adaugare_prim(y,a[x]->p,a[x]->u);
else
adaugare_sf(y,a[x]->u);
}
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);
adaugare(x,y);
adaugare(y,x);
}
}
void adancime (int vf){
a[vf]->viz=1;
for(nod *j=a[vf]->p;j;j=j->urm){
if(a[j->x]->viz==0){
adancime(j->x);
}
}
}
void afisare ()
{
freopen("dfs.out","w",stdout);
int nr=0;
for(int i=1;i<=n;i++){
if(a[i]->viz==0){
adancime(i);
nr++;
}
}
printf("%d\n",nr);
}
int main ()
{
citire();
afisare();
return 0;
}