90分求调，就第8个超时

#include<bits/stdc++.h>
using namespace std;
int a[10000];
int ship[10000];
int ans=0;
void chushi(int n){
    for(int i=0;i<=n;i++){
        a[i]=i;ship[i]=0;
}
}
int find(int x){
    if(x!=a[x]){
        int t=a[x];
        a[x]=find(a[x]);
        ship[x]=(ship[x]+ship[t])%3;
}
    return a[x];
}
void chacuo(int x,int y,int rship){
    int rootx=find(x);
    int rooty=find(y);
    if(rootx==rooty){
        if(rship-1!=(ship[x]-ship[y]+3)%3) ans++;
}
    else{
        a[rootx]=rooty;
        ship[rootx]=(ship[y]-ship[x]+rship-1)%3;
}
}
int main(){
    ios::sync_with_stdio(0);
    int n,k;
    cin>>n>>k;
    chushi(n);
    for(int i=0;i<k;i++){
        int rship,x,y;
        cin>>rship>>x>>y;
        if(x < 1 || x > n || y < 1 || y > n) ans++;
        else chacuo(x,y,rship);
}
    cout<<ans<<endl;
    return 0;
}