D. Cow and Snacks(思维+并查集)

https://codeforces.com/problemset/problem/1209/D

---

思路:每个连通块内考虑问题,将有关系的食物连成一个连通块。每个块的贪心解就是其连通块的siz-1

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL fa[maxn],siz[maxn];
LL find(LL x){
    if(fa[x]!=x) return fa[x]=find(fa[x]);
    return fa[x];
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,k;cin>>n>>k;
  for(LL i=1;i<=n;i++) fa[i]=i,siz[i]=1;
  for(LL i=1;i<=k;i++){
    LL x,y;cin>>x>>y;
    if(find(x)!=find(y)){
        LL t1=find(x);LL t2=find(y);
        siz[t1]+=siz[t2];
        fa[t2]=t1;
    }
  }
  LL ans=0;
  for(LL i=1;i<=n;i++){
      if(fa[i]==i){
         //cout<<fa[i]<<" "<<siz[i]<<"\n";
         ans+=(siz[i]-1);
      }
  }
  cout<<k-ans<<"\n";
return 0;
}