RT,1,3AC,2,8,10WA,其他MLE

https://cdn.luogu.com.cn/upload/image_hosting/4u4qz2lx.png

150501*4B=602004B=587.89KB=0.5714MB<125.00MB

#include<bits/stdc++.h>
using namespace std;
int f[150501];
int find(int x)
{
	if(f[x]==x)return x;
	return f[x]=find(f[x]);
}
int main()
{
	int n,k,ans=0;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n+n+n;i++) f[i]=i;
	while(k--)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		if(b>n||c>n){ans++;continue;} 
		if(a==1)
		{
			if(find(b+n+n)==find(c)||find(b)==find(c+n+n)){ans++;continue;}
			f[b]=c;
			f[b+n]=c+n;
			f[b+n+n]=c+n+n;
		}
		else
		{
			if(find(b)==find(c)){ans++;continue;}
			f[b]=c+n+n;
			f[b+n]=c;
			f[b+n+n]=c+n;
		}
	}
	printf("%d",ans);
	return 0;
}