30分？

#include<bits/stdc++.h>
#define N 50010 
using namespace std;
int n,k,fa[N*3];
int has(int x){return fa[x]==x?x:fa[x]=has(fa[x]);}
void merge(int x,int y){fa[x]=y;}
int main(){
    std::ios::sync_with_stdio(false);
    cin>>n>>k;
    for(register int i=1;i<=n*3;++i) fa[i]=i;
    int ans=0;
    while(k--){
    	int p,x,y;cin>>p>>x>>y;
    	if(x>n||y>n){++ans;continue;}
    	if(p==1)
    		if(has(x)==has(y+n)||has(x+n)==has(y)) ++ans;
    		else merge(x,y),merge(x+n,y+n),merge(x+n*2,y+n*2);
		else if(p==2)
			if(has(x)==has(y)||has(x)==has(y+n)||has(x+n*2)==has(y)) ++ans;
			else merge(x+n,y),merge(y+n*2,x),merge(y+n,x+n*2);
	}
	cout<<ans<<endl;
	return 0;
}