Cow and Snacks

最新推荐文章于 2024-02-04 21:50:28 发布

bootdubbo

最新推荐文章于 2024-02-04 21:50:28 发布

阅读量284

点赞数

CC 4.0 BY-SA版权

分类专栏：并查集

本文链接：https://blog.csdn.net/zt2650693774/article/details/100905346

并查集专栏收录该内容

4 篇文章

订阅专栏

在Farmer John的派对上，Bessie需要帮助分配各种口味的零食给客人，每位客人都有两种喜爱的口味。通过优化客人排队顺序，Bessie的目标是最小化没有得到喜爱零食的客人数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

outputstandard output
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<bits/stdc++.h>
using namespace std;
#define maxn 100010
#define INF 0x3f3f3f3f
typedef long long ll;
struct Edge{
	int to,nxt;
}edge[maxn];
int pre[maxn],siz[maxn];
int find(int x){
	if(pre[x]==x) return x;
	return pre[x]=find(pre[x]);
}
void unite(int x,int y){
	int fx=find(x);
	int fy=find(y);
	if(fx!=fy) pre[fx]=fy;
}
int main(){
	int n,k; scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) pre[i]=i;
	int cnt=0;
	for(int i=1;i<=k;i++){
		int u,v; scanf("%d%d",&u,&v);
		unite(u,v);
	} 
	for(int i=1;i<=n;i++) siz[find(i)]++;
	for(int i=1;i<=n;i++){
		if(pre[i]==i) cnt+=siz[find(i)]-1;
	} 
	printf("%d\n",k-cnt);
	return 0;
}