POJ 3259 解题报告

这道题是检查一个有向图中是否存在着一个负环，标准算法是Bellman-Ford algorithm: http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm.

刚开始用的是Floyd-Warshall算法求出了所有点对之间的距离，就TLE了。

3259

Accepted

2240K

219MS

C++

2322B

/* 
ID: thestor1 
LANG: C++ 
TASK: poj3259 
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

const int MAXN = 500;

class Edge
{
public:
	int u, v, w;
	Edge() {}
	Edge(int u, int v, int w) : u(u), v(v), w(w) {}
};

int main()
{
	long long weight[MAXN];
	long long dis[MAXN][MAXN];

	int F;
	scanf("%d", &F);
	for (int f = 0; f < F; ++f)
	{
		int N, M, W;
		scanf("%d%d%d", &N, &M, &W);

		weight[0] = 0;
		for (int i = 1; i < N; ++i)
		{
			weight[i] = LLONG_MAX;
		}

		for (int i = 0; i < N; ++i)
		{
			for (int j = 0; j < N; ++j)
			{
				dis[i][j] = LLONG_MAX;
			}
		}

		int S, E, T;
		for (int i = 0; i < M; ++i)
		{
			scanf("%d%d%d", &S, &E, &T);
			S--, E--;
			dis[S][E] = min(dis[S][E], (long long)T);
			dis[E][S] = min(dis[E][S], (long long)T);
		}

		for (int i = 0; i < W; ++i)
		{
			scanf("%d%d%d", &S, &E, &T);
			S--, E--;
			dis[S][E] = min(dis[S][E], (long long)-T);
		}
		
		std::vector<Edge> edges;
		for (int i = 0; i < N; ++i)
		{
			for (int j = 0; j < N; ++j)
			{
				if (dis[i][j] < LLONG_MAX)
				{
					edges.push_back(Edge(i, j, dis[i][j]));
				}
			}
		}

		// printf("edges:\n");
		// for (int i = 0; i < edges.size(); ++i)
		// {
		// 	printf("%d, %d, %d\n", edges[i].u, edges[i].v, edges[i].w);
		// }

		for (int i = 0; i < N - 1; ++i)
		{
			for (int j = 0; j < edges.size(); ++j)
			{
				int u = edges[j].u, v = edges[j].v, w = edges[j].w;
				if (weight[u] != LLONG_MAX && weight[u] + w < weight[v])
				{
					weight[v] = weight[u] + w;
				}
			}
		}

		bool possible = false;
		for (int i = 0; i < edges.size(); ++i)
		{
			int u = edges[i].u, v = edges[i].v, w = edges[i].w;
			if (weight[u] != LLONG_MAX - w && weight[u] + w < weight[v])
			{
				possible = true;
				break;
			}
		}

		// printf("weight\n");
		// for (int i = 0; i < N; ++i)
		// {
		// 	printf("%d: %lld\n", i, weight[i]);
		// }

		if (possible)
		{
			printf("YES\n");
		}
		else
		{
			printf("NO\n");
		}
	}

	return 0;  
}