查看删除 2020NYIST个人积分赛第十场-I

题面

原题：CodeForces - 1209D

The legendary Farmer John is throwing a huge party, and animals from all over the world are hanging out at his house. His guests are hungry, so he instructs his cow Bessie to bring out the snacks! Moo!

There are n snacks flavors, numbered with integers 1,2,…,n. Bessie has n snacks, one snack of each flavor. Every guest has exactly two favorite flavors. The procedure for eating snacks will go as follows:

First, Bessie will line up the guests in some way.
Then in this order, guests will approach the snacks one by one.
Each guest in their turn will eat all remaining snacks of their favorite flavor. In case no favorite flavors are present when a guest goes up, they become very sad.
Help Bessie to minimize the number of sad guests by lining the guests in an optimal way.

Input
The first line contains integers n and k (2≤n≤105, 1≤k≤105), the number of snacks and the number of guests.

The i-th of the following k lines contains two integers xi and yi (1≤xi,yi≤n, xi≠yi), favorite snack flavors of the i-th guest.

Output
Output one integer, the smallest possible number of sad guests.

Examples
Input
5 4
1 2
4 3
1 4
3 4
Output
1
Input
6 5
2 3
2 1
3 4
6 5
4 5
Output
0
Note
In the first example, Bessie can order the guests like this: 3,1,2,4. Guest 3 goes first and eats snacks 1 and 4. Then the guest 1 goes and eats the snack 2 only, because the snack 1 has already been eaten. Similarly, the guest 2 goes up and eats the snack 3 only. All the snacks are gone, so the guest 4 will be sad.

In the second example, one optimal ordering is 2,1,3,5,4. All the guests will be satisfied.

题意

思路

这个和模板裸题有点小区别，就是集合并不是由人组成的，而是人指向目标的。因此只要每次将人指向目标合并，然后用并查集判断一下两个零食是否在一个集合中即可。

代码

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 1e5 + 10;
int pre[maxn];
void init()
{
	for (int i = 0; i < maxn; i++)
	{
		pre[i] = i;//初始化
	}
}
int find(int x)
{
	return pre[x] == x ? x : pre[x] = find(pre[x]);//路径压缩
}
int main()
{
	int n, k;//n种零食  k个客人
	cin >> n >> k;
	int ans = 0;
	init();
	while (k--)
	{
		int a, b;
		cin >> a >> b;
		a = find(a);
		b = find(b);
		if (a == b)
			ans++;
		pre[a] = b;
	}
	cout << ans << endl;
}