Pagini recente » Cod sursa (job #514722) | Cod sursa (job #907474) | Monitorul de evaluare | Cod sursa (job #907487) | Cod sursa (job #3344129)
#include <bits/stdc++.h>
#define eb emplace_back
#define cin fin
#define cout fout
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int t[100020], r[100020];
void unire(int x, int y)
{
if (r[x]>r[y])
t[y]=x;
else
{
if (r[x]<r[y])
t[x]=y;
else
{
t[y]=x;
r[x]++;
}
}
}
int findu(int x)
{
int temp, rad;
rad=x;
while (t[rad]!=0)
rad=t[rad];
while (t[x]!=0)
{
temp=t[x];
t[x]=rad;
x=temp;
}
return rad;
}
int n, m, x, y, c, nr;
int r1, r2;
int main()
{
cin>>n>>m;
vector<vector<int>> comp(n+1);
nr=n;
for (int i=1; i<=n; i++)
comp[i].eb(i);
for (int i=1; i<=m; i++)
{
cin>>x>>y;
r1=findu(x);
r2=findu(y);
if (r1!=r2)
{
if (r[r1]>=r[r2])
{
for (auto i:comp[y])
comp[r1].eb(i);
comp[y].clear();
unire(r1, r2);
nr--;
}
else
{
for (auto i:comp[x])
comp[r2].eb(i);
comp[x].clear();
unire(r1, r2);
nr--;
}
}
}
cout<<nr;
}