73分求助

#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int inf = 1e9 + 7;
struct node {
	int dis, u;
	bool operator>(node& a) { return dis > a.dis; }
};
struct edge {
	int v, w;
};
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, m;
	cin >> n >> m;

	vector<vector<edge>> e(n + 1);
	vector<int> dis(n + 1, inf), vis(n + 1), cnt(n + 1);
	queue<int> q;
	for(int i = 1; i <= m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		e[v].push_back({u, w});
	}

	for(int i = 1; i <= n; i++) {
		e[0].push_back({i, 0});
	}
	q.push(0);
	vis[0] = 1;
	dis[0] = 0;
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		vis[u] = 0;
		for(auto ed : e[u]) {
			auto [v, w] = ed;
			if(dis[v] > dis[u] + w) {	
				dis[v] = dis[u] + w;
				cnt[v] = cnt[u] + 1;
								//cnt[v]++;
				if(cnt[v] > n) return cout << "No\n", 0;
				if(!vis[v]) vis[v] = 1, q.push(v);
			}
		}
	}
	int minp = inf;
	for(int i = 1; i <= n; i++) {
		minp = min(minp, dis[i]);
	}
	for(int i = 1; i <= n; i++) {
		cout << dis[i] - minp << " \n"[i == n];
	}
	return 0;
}