洛谷 2024 食物链

//对于某种特定的动物，世界上只有三种动物，同类、他吃的和吃他的，按三类的关系维护并查集即可，注意要三类转移，而不仅转移当前动物的 。 
//i+n吃i，i+2*n吃i+n, i吃i+2*n 
#include<bits/stdc++.h>
using namespace std;
const int maxn = 50010;
int n, k, ans;
int f[3*maxn];

inline void getInit(){
    int nn = 3*n;//初始化3倍！ 
    for(int i = 1; i <= nn; i++)
        f[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);
}

inline bool ask(int x, int y){
    if(find(x) == find(y))  return 1;
    return 0;
}

int main(){
    scanf("%d%d", &n, &k);
    getInit();
    for(int i = 1, op, x, y; i <= k; i++){
        scanf("%d%d%d", &op, &x, &y);
        if(x > n || y > n){
            ans++;
            continue;
        }
        if(op == 1){
            if(ask(x, y+n) || ask(x, y+2*n) || ask(y, x+n) || ask(y, x+2*n)){
                ans++;
                continue;
            }
            merge(x, y), merge(x+n, y+n), merge(x+2*n, y+2*n);
        }
        else if(op == 2){
            if(x == y || ask(x, y) || ask(x, y+2*n)){
                ans++;
                continue;
            }
            merge(x, y+n);
            merge(x+n, y+2*n);
            merge(x+2*n, y);
        }
    }
    printf("%d\n", ans);
    return 0;
}