#include "escape_route.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll,int,int> trio;
typedef pair<ll,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
int n;
ll s, L[100][100], C[100][100], dist[100][100];
vector<trio> query[100];
void pre_calc(int raiz) {
for(int i = 0; i < n; i++) dist[raiz][i] = -1;
vector<bool> vis(n);
dist[raiz][raiz] = 0;
while(1) {
ll D = -1;
int x = -1;
for(int i = 0; i < n; i++) {
if(dist[raiz][i] != -1 and !vis[i] and (D == -1 or D > dist[raiz][i]))
D = dist[raiz][i], x = i;
}
if(x == -1) break;
vis[x] = 1;
for(int viz = 0; viz < n; viz++) {
if(L[x][viz] == 0) continue;
ll D_viz;
if(D%s <= C[x][viz] - L[x][viz]) D_viz = D + L[x][viz];
else D_viz = D + s - D%s + L[x][viz];
if(dist[raiz][viz] == -1 or dist[raiz][viz] >= D_viz)
dist[raiz][viz] = D_viz;
}
}
}
vector<ll> dijkstra(int raiz, ll t, ll &min_change) {
vector<ll> d(n);
for(int i = 0; i < n; i++) d[i] = -1;
vector<bool> vis(n);
d[raiz] = t;
min_change = s;
while(1) {
ll D = -1;
int x = -1;
for(int i = 0; i < n; i++) {
if(d[i] != -1 and !vis[i] and (D == -1 or D > d[i]))
D = d[i], x = i;
}
if(x == -1) break;
vis[x] = 1;
for(int viz = 0; viz < n; viz++) {
if(L[x][viz] == 0) continue;
if(D%s > C[x][viz] - L[x][viz]) continue;
min_change = min(C[x][viz] - L[x][viz] - D%s, min_change); // a partir desse valor a aresta fica inválida
ll D_viz = D + L[x][viz];
if(d[viz] == -1 or d[viz] >= D_viz)
d[viz] = D_viz;
}
}
return d;
}
vector<ll> calculate_necessary_time(int N, int M, ll S, int Q,
vector<int> A, vector<int> B, vector<ll> l, vector<ll> c,
vector<int> U, vector<int> V, vector<ll> T) {
n = N;
s = S;
for(int i = 0; i < M; i++) {
L[A[i]][B[i]] = L[B[i]][A[i]] = l[i];
C[A[i]][B[i]] = C[B[i]][A[i]] = c[i];
}
for(int i = 0; i < Q; i++)
query[U[i]].pb({T[i],V[i],i});
vector<ll> ans(Q, (ll)1e18);
for(int i = 0; i < N; i++) pre_calc(i);
for(int raiz = 0; raiz < N; raiz++) {
sort(all(query[raiz]));
ll min_change = 0, last_t = -1;
vector<ll> d;
for(auto [tempo, fim, ind] : query[raiz]) {
if(last_t + min_change >= tempo) {
for(int i = 0; i < n; i++)
if(d[i] != -1) d[i] += tempo - last_t;
min_change -= tempo - last_t;
last_t = tempo;
}
else {
d = dijkstra(raiz, tempo, min_change);
last_t = tempo;
}
if(d[fim] != -1) ans[ind] = d[fim];
for(int i = 0; i < n; i++) {
if(d[i] != -1) {
ans[ind] = min(ans[ind], d[i] + s - d[i]%s + dist[i][fim]);
}
}
ans[ind] -= tempo;
}
}
return ans;
}
