HDU 4318 Power transmission（最短路变形）

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>

using namespace std;

const int maxn = 50010;

int n;
struct Edge {
	int v;
	double p;
}edge;
vector<Edge> v[maxn];
int start, end, m;
bool inq[maxn];
double dis[maxn];

void spfa()
{
	memset(inq, false, sizeof(inq));
	for (int i = 0; i < maxn; ++i) {
		dis[i] = 0;
	}
	deque<int> Q;
	dis[start] = 1;
	Q.push_back(start);
	inq[start] = true;
	
	while (!Q.empty()) {
		int cur = Q.front();
		Q.pop_front();
		int size = v[cur].size();
		for (int i = 0; i < size; ++i) {
			int vv = v[cur][i].v;
			double pp = v[cur][i].p;
			if (dis[cur] * pp >= dis[vv]) {
				dis[vv] = dis[cur] * pp;
				if (!inq[vv]) {
					if (!Q.empty() && dis[cur] * pp >= dis[Q.front()]) {
						Q.push_front(vv);
					} else {
						Q.push_back(vv);
					}
					inq[vv] = true;
				}
			}
		}
		inq[cur] = false;
	}
	if (dis[end] == 0) {
		printf("IMPOSSIBLE!\n");
	} else {
		printf("%.2lf\n", m * (1 - dis[end]));
	}
	return ;
}

int main()
{
	while (scanf("%d", &n) != EOF) {
		for (int i = 0; i < maxn; ++i) {
			v[i].clear();
		}
		int k, a, b;
		for (int i = 1; i <= n; ++i) {
			scanf("%d", &k);
			for (int j = 0; j < k; ++j) {
				scanf("%d%d", &a, &b);
				edge.v = a;
				edge.p = 1 - b / 100.0;
				v[i].push_back(edge);
			}
		}
		scanf("%d%d%d", &start, &end, &m);
		spfa();
	}
	return 0;
}