ZOJ 2797 最短路

最新推荐文章于 2017-03-22 16:05:34 发布

茗_ming

最新推荐文章于 2017-03-22 16:05:34 发布

阅读量1k

点赞数

分类专栏： ACM_图论

本文链接：https://blog.csdn.net/livenls/article/details/10073665

版权

ACM_图论专栏收录该内容

28 篇文章 0 订阅

订阅专栏

最短路的修改变成概率相乘即可

SPFA

#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;

struct node
{
	int v, next, w;
}edge[21111];
int n, head[111];
double dist[111];
int inq[111], cnt;

inline void addnode(int u, int v, int w)
{
	edge[cnt].v = v; edge[cnt].w = w;
	edge[cnt].next = head[u]; head[u] = cnt++;
}


void spfa()
{
	queue<int > q;
	int v, w, u, i, j, k;
	fill(dist, dist + n + 1, 0);
	memset(inq, 0, sizeof(inq));
	dist[1] = 100; inq[1] = 1; q.push(1);
	while (!q.empty())
	{
		u = q.front(); q.pop(); inq[u]--;
		for (i = head[u]; ~i; i = edge[i].next)
		{
			v = edge[i].v; w = edge[i].w;
			if (1.0 * dist[u] * w / 100.0 > dist[v])
			{
				dist[v] = 1.0 * dist[u] * w / 100.0;
				if (!inq[v]) {inq[v]++; q.push(v);}
			}
		}
	}
}



int main()
{
	int m;
	while (scanf("%d", &n), n)
	{
		scanf("%d", &m);
		int i, j, k, u, v, w;
		cnt = 0;
		memset(head, -1, sizeof(head));
		for (i = 0; i < m; ++i)
		{
			scanf("%d%d%d", &u, &v, &w);
			addnode(u, v, w);
			addnode(v, u, w);
		}
		spfa();
		printf("%.6f percent\n", dist[n]);

	}

	return 0;
}