# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502918 | keta_tsimakuridze | Harbingers (CEOI09_harbingers) | C++14 | 124 ms | 25384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 1e5 + 5, mod = 1e9 + 7; // !
int t, v[N], s[N], n, cur_sz;
ll dp[N], h[N];
vector<pii> V[N];
struct line {
int k, b;
};
vector<line> ts;
ll f(int k,int x,int b) {
return (ll)k * x + b;
}
double X_(line a, line b) {
// a.k * x + a.b = b.k * x + b.b
return (double)(b.b - a.b) / (a.k - b.k);
}
void dfs(int u,int p) {
// s[u] + (h[u] - h[p]) * v[u] + dp[p]
// -h[p] * v[u] + dp[p] + s[u] + h[u] * v[u]
vector<line> rem;
dp[u] = 0;
int l = 0, r = cur_sz - 2;
if(cur_sz) dp[u] = min(dp[u], f(ts[0].k, v[u], ts[0].b));
while(l <= r) {
int mid = (l + r) / 2;
if(X_(ts[mid], ts[mid + 1]) <= v[u]) l = mid + 1, dp[u] = min(dp[u], f(ts[mid + 1].k, v[u], ts[mid + 1].b));
else r = mid - 1;
}
dp[u] += (ll) h[u] * v[u] + s[u];
line new_;
new_.k = -h[u]; new_.b = dp[u];
l = 0, r = cur_sz - 2;
int pos = cur_sz;
while(l <= r) {
int mid = (l + r) / 2;
if(X_(ts[mid], ts[mid + 1]) >= X_(ts[mid], new_)) pos = mid + 1, r = mid - 1;
else l = mid + 1;
}
int prev_sz = cur_sz;
line prev_val = {0, 0};
prev_val = ts[pos], ts[pos] = new_, cur_sz = pos + 1;
for(int i = 0; i < V[u].size(); i++) {
if(V[u][i].f == p) continue;
h[V[u][i].f] = h[u] + V[u][i].s;
dfs(V[u][i].f, u);
}
ts[pos] = prev_val, cur_sz = prev_sz;
}
main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int n; cin >> n;
for(int i = 2; i <= n; i++) {
int u,v, w;
cin >> u >> v >> w;
V[u].push_back({v, w});
V[v].push_back({u, w});
}
for(int i = 2; i <= n; i++) {
int p;
cin >> s[i] >> v[i];
}
ts.resize(n);
dfs(1, 0);
for(int i = 2; i <= n; i++) cout << dp[i] <<" ";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |