【2022年10月25日A组】不稳定的道路【最短路】【贪心】

思路：

发现到达一个点的时间越小越好。
根据初中知识，我们发现在根号d+1的时候是最小的，那么我们就直接等到那个时候在走。

$code$

#include<iostream>
#include<cstdio>
#include<queue>
#include<cmath>

#define ll long long

using namespace std;

const ll MAXN = 1e5 + 10;

ll n, m;
ll tot, head[MAXN];
struct node {
	ll to, next, c, d, g;
}b[MAXN * 2];
priority_queue<pair<ll, ll> > q;
ll dis[MAXN];
bool v[MAXN];

void add(ll x, ll y, ll c, ll d, ll g) {
	b[++ tot] = (node) { y, head[x], c, d, g };
	head[x] = tot;
}

int main() {
	freopen("road.in", "r", stdin);
	freopen("road.out", "w", stdout);
	scanf("%lld%lld", &n, &m);
	for(ll i = 1; i <= m; i ++) {
		ll x, y, c, d;
		scanf("%lld%lld%lld%lld", &x, &y, &c, &d);
		ll g = (ll)sqrt(d);
		if(d - g * g  > (g + 1) * (g + 1) - d) g = g + 1;
		g = g - 1;
		add(x, y, c, d, g), add(y, x, c, d, g);
	}
	for(ll i = 1; i <= n; i ++) dis[i] = 1e18;
	dis[1] = 0;
	q.push(make_pair(0, 1));
	while(!q.empty()) {
		ll t = -q.top().first, x = q.top().second;
		q.pop();
		if(v[x]) continue;
		v[x] = 1;
		for(ll i = head[x]; i; i = b[i].next) {
			ll y = b[i].to, g = b[i].g;
			if(v[y]) continue;
			if(t <= g) {
				if(dis[y] > g + b[i].c + b[i].d / (g + 1)) 
					dis[y] = g + b[i].c + b[i].d / (g + 1), q.push(make_pair(-dis[y], y));
			}
			else {
				if(dis[y] > t + b[i].c + b[i].d / (t + 1))
					dis[y] = t + b[i].c + b[i].d / (t + 1), q.push(make_pair(-dis[y], y));
			}
		}
	}
	if(dis[n] == 1e18) printf("-1");
	else printf("%lld", dis[n]);
	return 0;
}