#include <bits/stdc++.h>
using namespace std;
struct LinearFn
{
int64_t m, t;
LinearFn(int64_t m_, int64_t t_) { m = m_, t = t_; }
int64_t operator()(int64_t x) { return m * x + t; }
};
#define N 100000
int64_t s[N], v[N], d[N], ans[N];
vector<pair<size_t, int64_t>> g[N];
void find_shortest_route(size_t u, size_t p, deque<LinearFn> &q)
{
if (!q.empty())
{
size_t a = 0, b = q.size() - 1;
while (a < b)
{
size_t mid = (a + b) / 2;
if ((mid < q.size() - 1 && q[mid](v[u]) <= q[mid + 1](v[u])) ||
(mid && q[mid - 1](v[u]) <= q[mid](v[u])))
b = mid;
else
a = mid + 1;
}
ans[u] = q[a](v[u]) + d[u] * v[u] + s[u];
q.emplace_back(-d[u], ans[u]);
}
else
{
q.emplace_back(0, 0);
}
for (auto [x, w] : g[u])
{
if (x != p)
{
d[x] = d[u] + w;
find_shortest_route(x, u, q);
}
}
q.pop_back();
}
int main()
{
size_t n;
cin >> n;
for (size_t i = 0; i + 1 < n; i++)
{
size_t u, v, w;
cin >> u >> v >> w;
g[u - 1].emplace_back(v - 1, w);
g[v - 1].emplace_back(u - 1, w);
}
for (size_t i = 1; i < n; i++)
cin >> s[i] >> v[i];
deque<LinearFn> q;
find_shortest_route(0, SIZE_MAX, q);
for (size_t i = 1; i < n; i++)
cout << ans[i] << ' ';
cout << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
2 |
Incorrect |
5 ms |
3156 KB |
Output isn't correct |
3 |
Incorrect |
85 ms |
11960 KB |
Output isn't correct |
4 |
Incorrect |
146 ms |
16332 KB |
Output isn't correct |
5 |
Incorrect |
166 ms |
20668 KB |
Output isn't correct |
6 |
Incorrect |
188 ms |
24728 KB |
Output isn't correct |
7 |
Incorrect |
125 ms |
12520 KB |
Output isn't correct |
8 |
Incorrect |
188 ms |
17604 KB |
Output isn't correct |
9 |
Incorrect |
173 ms |
19648 KB |
Output isn't correct |
10 |
Incorrect |
163 ms |
18268 KB |
Output isn't correct |