90分TLE求优化

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5;
int n, m, v[N], u[N], w[N], dis[N], T;
bool bellman(){
    for(int i = 1; i <= n; i++) dis[i] = 1;
    int cnt = 0;
    while(true){
        if(++ cnt > n) return false;
        bool flag = true;
        for(int i = 1; i <= m; i++)
            if(dis[u[i]] + w[i] > dis[v[i]]){
                dis[v[i]] = dis[u[i]] + w[i];
                flag = false;
            }
        if(flag) break;
    }
    return true;
}

signed main(){
    cin >> n >> T;
    while(T --){
        m ++;
        int op, a, b; cin >> op >> a >> b;
        if(op == 1){
            u[m] = a, v[m] = b, w[m] = 0;
            m ++;
            u[m] = b, v[m] = a, w[m] = 0;
        }
        if(op == 2) u[m] = a, v[m] = b, w[m] = 1;
        if(op == 3) u[m] = b, v[m] = a, w[m] = 0;
        if(op == 4) u[m] = b, v[m] = a, w[m] = 1;
        if(op == 5) u[m] = a, v[m] = b, w[m] = 0;
    }
    if(!bellman()) cout << "-1" << "\n";
    else{
        int ans = 0;
        for(int i = 1; i <= n; i++) ans += dis[i];
        cout << ans << "\n";
    }
	return 0;
}