Wormholes POJ - 3259 SPFA

题解

题目的意思就是问一个带负边的图是否有负环，使用SPFA求解。如果某个节点第n次入队则说明当前图有负环输出YES。

AC代码

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <queue>
#define fst first
#define sed second
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int N = 3e3;
vector<pair<int, int>> e[N];
int n, m, w;
bool vis[N];
int dis[N], cnt[N]; //cnt入队次数

bool SPFA()
{
	memset(vis, 0, sizeof(vis));
	memset(cnt, 0, sizeof(cnt));
	memset(dis, 0x3f, sizeof(dis));
	queue<int> q; //只节点
	q.push(1); //找负环任意起点
	dis[1] = 0;
	cnt[1] = vis[1] = 1;
	while (!q.empty())
	{
		int u = q.front(); q.pop();
		vis[u] = 0;
		for (int i = 0; i < e[u].size(); ++i)
		{
			int v = e[u][i].fst, w = e[u][i].sed;
			if (dis[u] + w < dis[v]) //代价更小
			{
				dis[v] = dis[u] + w; //先更新在判断
				if (!vis[v]) //不在队列中
				{
					if (++cnt[v] == n) //第n次入队
						return 1; //负环
					q.push(v), vis[v] = 1;
				}
			}
		}
	}
	return 0;
}
int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
	int T;
	cin >> T;
	while (T--)
	{
		cin >> n >> m >> w;
		for (int i = 1; i <= n; ++i) e[i].clear();
		int u, v, t;
		for (int i = 0; i < m; ++i)
		{
			scanf("%d%d%d", &u, &v, &t);
			e[u].push_back(make_pair(v, t));
			e[v].push_back(make_pair(u, t));
		}
		for (int i = 0; i < w; ++i)
		{
			scanf("%d%d%d", &u, &v, &t);
			e[u].push_back(make_pair(v, -t));
		}
		printf("%s\n", SPFA() ? "YES" : "NO");
	}

	return 0;
}