1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
#include <bits/stdc++.h>
#define FIO cin.tie(0); ios::sync_with_stdio(false)
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define TEST
#define TESTS int t = 1; cin >> t; while (t--)
#if 0
#define int i64
#define inf 0x3f3f3f3f3f3f3f3fLL
#else
#define inf 0x3f3f3f3f
#endif
#ifndef ONLINE_JUDGE
#define debug(...) std::cerr << #__VA_ARGS__ << " = "; dbg1(__VA_ARGS__)
void dbg2() { std::cerr << "\n"; }
template<typename T, typename... T2>
void dbg2(T x, T2... args) {
std::cerr << ", " << x;
dbg2(args...);
}
template<typename T, typename... T2>
void dbg1(T x, T2... args) {
std::cerr << x;
dbg2(args...);
}
#else
#define debug(...)
#endif
using namespace std;
using i64 = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using pii = std::pair<int, int>;
inline char nc() {
static char buf[1 << 20], *p1, *p2;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++;
}
#ifndef ONLINE_JUDGE
#define nc getchar
#endif
void read() {}
template<typename T, typename... T2>
inline void read(T &x, T2 &... oth) {
x = 0; char c = nc(), up = c;
while(!isdigit(c)) up = c, c = nc();
while(isdigit(c)) x = x * 10 + c - '0', c = nc();
up == '-' ? x = -x : 0;
read(oth...);
}
constexpr i64 N = 3e5 + 10;
constexpr i64 M = 1e18;
#define lc(x) t[x].l
#define rc(x) t[x].r
struct node {
int l, r;
int k;
i64 b = 1e18;
} t[N * 30];
int idx;
i64 calc(int k, i64 b, i64 x) {
return k * x + b;
}
void modify(int& x, i64 l, i64 r, int k, i64 b) {
if (!x) {
x = ++idx;
lc(x) = rc(x) = 0;
t[x].k = k;
t[x].b = b;
return;
}
i64 mid = l + r >> 1;
if (calc(k, b, mid) < calc(t[x].k, t[x].b, mid)) {
swap(k, t[x].k);
swap(b, t[x].b);
}
if (l == r) return;
if (k < t[x].k) modify(rc(x), mid + 1, r, k, b);
else modify(lc(x), l, mid, k, b);
}
i64 query(int x, i64 l, i64 r, i64 v) {
if (!x || l == r) return calc(t[x].k, t[x].b, v);
i64 mid = l + r >> 1;
return min(calc(t[x].k, t[x].b, v), mid < v ? query(rc(x), mid + 1, r, v) : query(lc(x), l, mid, v));
}
void solve() {
idx = 0;
int n, m;
cin >> n >> m;
vector<vector<array<i64, 3>>> e1(n + 1), e2(n + 1);
vector<array<i64, 4>> edges(m);
i64 R = 1e9;
for (auto& [u, v, t, w] : edges) {
cin >> u >> v >> t >> w;
e1[u].push_back({v, t, w});
e2[v].push_back({u, t, w});
R = min(R, t / w);
}
vector<i64> dis1(n + 1, 1e18), dis2(n + 1, 1e18);
auto dijkstra = [&](auto& dis, auto& e, int s) {
priority_queue<pair<i64, int>, vector<pair<i64, int>>, greater<>> q;
q.emplace(0, s);
dis[s] = 0;
while (q.size()) {
auto [d, u] = q.top();
q.pop();
if (d > dis[u]) continue;
for (auto [v, t, w] : e[u]) {
if (dis[v] > d + t) {
dis[v] = d + t;
q.emplace(dis[v], v);
}
}
}
};
dijkstra(dis1, e1, 1);
dijkstra(dis2, e2, n);
int root = 0;
for (auto [u, v, t, w] : edges) {
modify(root, 1, R, -w, t + dis1[u] + dis2[v]);
}
int q;
cin >> q;
vector<int> queries(q);
while (q--) {
i64 k;
cin >> k;
cout << query(root, 1, R, k) << "\n";
}
}
signed main() {
FIO;
TESTS {
solve();
}
return 0;
}
|
