P5837 [USACO19DEC]Milk Pumping G(枚举+dijkstra)

P5837 [USACO19DEC]Milk Pumping Ghttps://www.luogu.com.cn/problem/P5837

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


int n, m;
int head[MAXN];
int nxt[MAXN];
int cost[MAXN];
int ver[MAXN];
int f[MAXN];
int liu[MAXN];
int cnt;
int d[MAXN];
inline void add(int x, int y, int c, int z) {
	ver[++cnt] = y;
	nxt[cnt] = head[x];
	cost[cnt] = c;
	liu[cnt] = z;
	f[cnt] = z;
	head[x] = cnt;
}
double ans = 0;
typedef pair<int, int> P;

inline void dijkstra(int s) {
	priority_queue<P> que;
	for (int i = 1; i <= n; i++) {
		d[i] = INF;
	}
	d[1] = 0;
	que.push(P(0, 1));
	while (!que.empty()) {
		P t = que.top();
		que.pop();
		if (d[t.second] < -t.first) {
			continue;
		}
		for (int i = head[t.second]; i; i = nxt[i]) {
			int y = ver[i];
			if (liu[i] < s) {
				continue;
			} else {
				if (d[y] > d[t.second] + cost[i]) {
					d[y] = d[t.second] + cost[i];
					que.push(P(-d[y], y));
				}
			}

		}
	}
	if (d[n] == INF) {
		return;
	}
	ans = max(ans, (double)((1.0 * s) / d[n]));
}

int main() {
	int x, y, c, z;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d %d", &x, &y, &c, &z);
		add(x, y, c, z);
		add(y, x, c, z);
	}
	sort(f + 1, f + cnt + 1);
	int rec = unique(f + 1, f + cnt + 1) - f - 1;
	for (int i = 1; i <= rec; i++) {
		dijkstra(f[i]);
	}
	printf("%d", (int)(ans * 1e6));
	return 0;
}