#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define lb(x,y) lower_bound(all(x),y)-begin(x)
mt19937 rng;
struct Line {
mutable ll k, m, p;
bool operator<(const Line& o) const { return k < o.k; }
bool operator<(ll x) const { return p < x; }
};
struct LineContainer : multiset<Line, less<>> {
// (for doubles, use inf = 1/.0, div(a,b) = a/b)
static const ll inf = LLONG_MAX;
ll div(ll a, ll b) { // floored division
return a / b - ((a ^ b) < 0 && a % b); }
stack<pair<int, Line>> st;
int getTime() { return sz(st); }
void setTime(int t) {
while (sz(st) > t) {
auto p = st.top(); st.pop();
if (p.first == 1) {
erase(p.second);
} else if (p.first == 0) {
insert(p.second);
} else {
auto q = st.top(); st.pop();
auto n = lower_bound(p.second);
n->p = q.second.p;
}
}
}
bool isect(iterator x, iterator y) {
if (y == end()) return x->p = inf, 0;
if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
else x->p = div(y->m - x->m, x->k - y->k);
return x->p >= y->p;
}
bool isectR(iterator x, iterator y) {
st.push({2, *x});
bool res = isect(x, y);
st.push({2, *x});
return res;
}
void add(ll k, ll m) {
st.push({1, {k, m, 0}});
auto z = insert({k, m, 0}), y = z++, x = y;
while (isect(y, z)) st.push({0, *z}), z = erase(z);
if (x != begin() && isect(--x, y)) { st.push({0, *y}); isect(x, y = erase(y)); }
while ((y = x) != begin() && (--x)->p >= y->p)
st.push({0, *y}), isect(x, erase(y));
}
ll query(ll x) {
assert(!empty());
auto l = *lower_bound(x);
return l.k * x + l.m;
}
};
vector<vector<int>> adj;
vector<ll> p;
LineContainer lc;
vector<ll> res;
vector<int> s, v;
void dfs(int u) {
if (u > 0) {
res[u] = -lc.query(v[u]) + s[u] + (ll)v[u] * p[u];
lc.add(p[u], -res[u]);
}
for (int v : adj[u]) {
int t = lc.getTime();
dfs(v);
lc.setTime(t);
}
}
void solve() {
int N; cin >> N;
adj = vector<vector<int>>(N);
vector<vector<int>> edges;
for (int i = 0; i < N - 1; i++) {
int u, v, k; cin >> u >> v >> k; u--; v--;
edges.pb({u, v, k});
adj[u].pb(v);
adj[v].pb(u);
}
s = vector<int>(N);
v = vector<int>(N);
for (int i = 1; i < sz(s); i++) cin >> s[i] >> v[i];
queue<int> q;
q.push(0);
vector<int> depth(N, 0);
vector<int> srt;
while (!q.empty()) {
int u = q.front(); q.pop();
srt.pb(u);
for (int v : adj[u]) {
adj[v].erase(find(all(adj[v]), u));
depth[v] = depth[u] + 1;
q.push(v);
}
}
p = vector<ll>(N, 0);
for (auto &edge : edges) {
int u = edge[0], v = edge[1], k = edge[2];
if (depth[v] > depth[u]) swap(u, v);
p[u] = k;
}
for (int u : srt) {
for (int v : adj[u]) p[v] += p[u];
}
lc.add(0, 0);
res = vector<ll>(N);
dfs(0);
for (int i = 1; i < sz(res); i++) {
cout << res[i] << (i == sz(res) - 1 ? "\n" : " ");
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
rng = mt19937(chrono::steady_clock::now().time_since_epoch().count());
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Correct |
2 ms |
1116 KB |
Output is correct |
| 3 |
Correct |
36 ms |
11268 KB |
Output is correct |
| 4 |
Correct |
54 ms |
16900 KB |
Output is correct |
| 5 |
Correct |
81 ms |
21504 KB |
Output is correct |
| 6 |
Correct |
87 ms |
27140 KB |
Output is correct |
| 7 |
Incorrect |
51 ms |
13820 KB |
Output isn't correct |
| 8 |
Incorrect |
130 ms |
21820 KB |
Output isn't correct |
| 9 |
Incorrect |
154 ms |
24324 KB |
Output isn't correct |
| 10 |
Incorrect |
332 ms |
23296 KB |
Output isn't correct |
