Submission #1266782

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266782		_ll	Harbingers (CEOI09_harbingers)	C++20	70 / 100	1097 ms	20548 KiB

harbingers

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
vector<array<ll, 2>> g[100000];
array<ll, 2> ps[100001], all[100000];
ll oo = 1e14, re[100000];

ld xinter(ll a, ll b){
        return ((ld) ps[b][1] - ps[a][1]) / ((ld) ps[a][0] - ps[b][0]);
}

ll vl(ll id, ll x){
        ll l = 1, r = id, m;
        while(l <= r){
                m = (l + r) >> 1;
                if(m >= id - 1 || x <= xinter(m, m + 1)) r = m - 1;
                else                                     l = m + 1;
        }
        return ps[l][0] * x + ps[l][1];
}

void dfs(ll p, ll at, ll del, ll id){
        ll res = vl(id, all[at][1]), c = all[at][0] + all[at][1] * del;
        re[at] = res + c;
        ps[100000] = {-del, res + c};
        while(id > 2 && xinter(id - 2, 1e5) <= xinter(id - 2, id - 1))
                --id;
        array<ll, 2> aux = ps[id];
        ps[id] = {-del, res + c};
        for(auto [i, j] : g[at]) if(i != p)
                dfs(at, i, del + j, id + 1);
        ps[id] = aux;
}

int main(){
        ios_base::sync_with_stdio(0);
        cin.tie(0); cout.tie(0);

        ll n; cin >> n;
        for(int i = 1, a, b, c; i < n; i++){
                cin >> a >> b >> c; a--, b--;
                g[a].push_back({b, c});
                g[b].push_back({a, c});
        }
        for(ll i = 1; i < n; i++)
                cin >> all[i][0] >> all[i][1];
        ps[0] = {1, 0};
        dfs(-1, 0, 0, 1);
        for(ll i = 1; i < n; i++)
                cout << re[i] << " ";
        cout << "\n";
}

• Subtask 1: 70 / 100