又WA又T的

#include<bits/stdc++.h>
using namespace std;

using i64 = long long;
using pii = pair<int, int>;

const int maxn = 1e5 + 5;
int n, k;
vector<pii> p[maxn];
int dis[maxn], cnt[maxn], vis[maxn];
queue<int> q;

int main() {
    scanf("%d%d", &n, &k);
    for(int i = 1; i <= k; ++i) {
        int x, u, v;
        scanf("%d%d%d", &x, &u, &v);
        if(x == 1) p[u].emplace_back(v, 0), p[v].emplace_back(u, 0);
        if(x == 2) p[v].emplace_back(u, -1);
        if(x == 3) p[u].emplace_back(v, 0);
        if(x == 4) p[u].emplace_back(v, -1);
        if(x == 5) p[v].emplace_back(u, 0);
    }
    for(int i = 1; i <= n; ++i) p[0].emplace_back(i, 0);
    for(int i = 1; i <= n; ++i) dis[i] = 0x3fffffff;
    dis[0] = 0; vis[0] = 1;
    q.push(0);
    while(q.size()) {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for(auto &[v, w] : p[u]) {
            if(dis[v] > dis[u] + w) {
                dis[v] = dis[u] + w;
                cnt[v] = cnt[u] + 1;
                if(cnt[v] >= n) {
                    printf("-1\n");
                    return 0;
                }
                if(!vis[v]) q.push(v), vis[v] = 1;
            }
        }
    }
    int mn = 0x3fffffff, res = 0;
    for(int i = 1; i <= n; ++i) mn = min(mn, dis[i]);
    for(int i = 1; i <= n; ++i) dis[i] -= mn - 1, res += dis[i];
    printf("%d\n", res);
    return 0;
}