Pagini recente » Cod sursa (job #77450) | Cod sursa (job #1803320) | Cod sursa (job #737774) | Cod sursa (job #1506865) | Cod sursa (job #660904)
Cod sursa(job #660904)
#include<fstream>
#define Nmax 100001
using namespace std;
struct muchie
{int x, y;};
muchie G[Nmax];
long long n, m, i, Max, Min, C[Nmax], j, fr[Nmax], c;
//ifstream fin("dfs.in");
//ofstream fout("dfs.out");
void comp_conexe()
{
for(i=1;i<=m;i++)
if(C[G[i].x]!=C[G[i].y])
{
if(C[G[i].x]>C[G[i].y])
Max=C[G[i].x], Min=C[G[i].y];
else
Max=C[G[i].y], Min=C[G[i].x];
for(j=1;j<=n;j++)
if(C[j]==Max) C[j]=Min;
}
}
int main()
{
freopen("dfs.in", "r", stdin);
freopen("dfs.out", "w", stdout);
scanf("%d%d", &n, &m);
//fin>>n>>m;
for(i=1;i<=m;i++)
scanf("%d%d", &G[i].x, &G[i].y);
//fin>>G[i].x>>G[i].y;
for(i=1;i<=n;i++)C[i]=i;
comp_conexe();
for(i=1;i<=n;i++)
if(!fr[C[i]])
{
fr[C[i]]=1;
c++;
}
printf("%d\n", c);
//fout<<c<<'\n';
//fin.close();
//fout.close();
fclose(stdin);
fclose(stdout);
return 0;
}