TLE100分 ， 求调

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
const int N = 1e5 + 10, M = 3 * N;
int n, m;
int h[N], e[M], ne[M], w[M], idx;
int dist[N], cnt[N];
bool st[N];
void add(int a, int b, int c) {
	e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}

//栈优化SPFA
bool spfa()
{
	deque<int> q;
	q.push_back(0);
	memset(dist,-0x3f,sizeof dist);
	dist[0] = 0;
	st[0] = true;
	
	while(q.size())
	{
		int t = q.back();
		q.pop_back();
		st[t] = false;
		if (cnt[t] >= n + 1) return true;
		
		for (int i = h[t]; i!=-1; i = ne[i])
		{
			int j = e[i];
			if (dist[j] < dist[t] + w[i])
			{
				dist[j] = dist[t] + w[i];			
				if (!st[j])
				{
					q.push_back(j);
					cnt[j] ++;
					st[j] = true;
				}
			}
		}
	}
	return false;
}

int main() {
	cin >> n >> m;
	memset(h, -1, sizeof h);
	while (m -- ) {
		int x, a, b;
		cin >> x >> a >> b;
		if (x == 1) add(b, a, 0), add(a, b, 0);
		else if (x == 2) add(a, b, 1);
		else if (x == 3) add(b, a, 0);
		else if (x == 4) add(b, a, 1);
		else add(a, b, 0);
	}
	for (int i = 1; i <= n; i ++ ) add(0, i, 1);
	
	if (spfa()) cout << "-1" << endl;
	else {
		ll res = 0;
		for (int i = 1; i <= n; i ++ ) res += dist[i];
		cout << res << endl;
	}
	return 0;
}