Pagini recente » Cod sursa (job #829621) | Implica-te! | Cod sursa (job #2094787)
#include<fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int N,M,x,y,T[100001],P[100001];
int Root(int x){
while(x!=T[x])x=T[x];
return x;
}
void Unire(int x,int y){
if(P[x]>P[y]){
T[y]=x;
}else if(P[x]<P[y]){
T[x]=y;
}else{
++P[x];
T[y]=x;
}
}
int main()
{
f>>N>>M;
for(int i=1;i<=N;++i)T[i]=i;
while(M--){
f>>x>>y;
int rx=Root(x);
int ry=Root(y);
if(rx!=ry)Unire(rx,ry);
}
x=0;
for(int i=1;i<=N;++i)
if(T[i]==i)++x;
g<<x;
return 0;
}