20pts求助，一寒假没写题不会做了

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e4;
int n,k,x,y,ans;
int f[N],eat[N],ate[N];
//f为并查集,eat[a]=b表示a吃b,ate[a]=b表示b被a吃
char c;
inline void init(){
    for(int i=1;i<=n;i++)
        f[i]=eat[i]=ate[i]=i;
}inline int find(int x){
    if(f[x]==x) return x;
    return f[x]=find(f[x]);
}inline void merge(int x,int y){
    f[find(x)]=find(y);
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>k;init();
    for(int i=1;i<=k;i++){
        cin>>c>>x>>y;
        if(x>n||y>n){
            ans++;
            continue;
        }else{
            if(c=='1'){
                if(x==y) continue;
                if(eat[f[x]]==f[y]||eat[f[y]]==f[x]){
                    ans++;
                    continue;
                }merge(x,y);
            }else{
                if(f[x]==f[y]){
                    ans++;
                    continue;
                }if(eat[x]==x) eat[x]=y;
                else merge(eat[x],y);
                if(ate[y]==y) ate[y]=x;
                else merge(x,ate[y]);
            }
        }
    }cout<<ans;
    return 0;
}