Submission #6660392

---

Source Code Expand

#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
typedef std::pair<LL, LL> P;
struct edge { LL to, cost, inter; };

const LL inf = 1123456789012345678;

std::vector<LL>dist;
std::vector<std::vector<edge>>G;
void dijkstra(LL s)
{
	std::priority_queue<P, std::vector<P>, std::greater<P>>que;
	std::fill(dist.begin(), dist.end(), inf);
	dist[s] = 0;
	que.push(P(0, s));
	while (!que.empty())
	{
		P p = que.top(); que.pop();
		LL v = p.second, t = p.first;
		if (dist[v] < p.first) continue;
		rep(i, G[v].size())
		{
			edge e = G[v][i];
			LL add = (t + e.inter - 1) / e.inter * e.inter - t;
			if (dist[e.to] > dist[v] + e.cost + add)
			{
				dist[e.to] = dist[v] + e.cost + add;
				que.push(P(dist[e.to], e.to));
			}
		}
	}
}

int main()
{
	LL N, M, K;
	in >> N >> M >> K;
	std::vector<LL>t(N), a(M), b(M), c(M), d(M);
	rep(i, N - 2) in >> t[i + 1];
	rep(i, M) in >> a[i] >> b[i] >> c[i] >> d[i];

	G.resize(N + 1); dist.resize(N + 1);
	rep(i, M)
	{
		G[a[i]].push_back({ b[i],c[i] + t[b[i] - 1],d[i] });
		G[b[i]].push_back({ a[i],c[i] + t[a[i] - 1],d[i] });
	}
	dijkstra(1);

	out << (dist[N] > K ? -1 : dist[N]) << std::endl;
}

Submission Info

Judge Result