제출 #434733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434733		ScarletS	Harbingers (CEOI09_harbingers)	C++17	60 / 100	184 ms	48744 KiB

harbingers

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
const int N = 1e5+4;
const ll INF = 1e18;
int s[N], v[N];
ll dp[N];
vector<array<int,2>> e[N];
 
ll f(ll a, ll b, int x)
{
    return a*x+b;
}
 
struct LiChao
{
    struct node
    {
        ll a = 0, b = 0;
        node *l, *r;
    };
    int n;
    node *root;
    deque<node> buffer;
    stack<int> prvSz;
    stack<node*> stk1;
    stack<array<ll,2>> stk2;
    node *newnode()
    {
        buffer.emplace_back();
        return &buffer.back();
    }
    LiChao(int n) : n(n)
    {
        root = newnode();
        prvSz.push(0);
    }
    void update(node *&v, int l, int r, ll a, ll b)
    {
        if (!v)
            v=newnode();
        int m=l+(r-l)/2;
        if (f(a,b,m)<f(v->a,v->b,m))
        {
            swap(a,v->a);
            swap(b,v->b);
            stk1.push(v);
            stk2.push({a,b});
        }
        if (l==r)
            return;
        if (f(a,b,l)<f(v->a,v->b,l))
            update(v->l,l,m,a,b);
        else if (f(a,b,r)<f(v->a,v->b,r))
            update(v->r,m+1,r,a,b);
    }
    void update(ll a, ll b)
    {
        update(root,0,n,a,b);
        prvSz.push(stk1.size());
    }
    ll query(node *v, int l, int r, int x)
    {
        if (!v)
            return INF;
        if (l==r)
            return f(v->a,v->b,x);
        int m=l+(r-l)/2;
        if (x<=m)
            return min(f(v->a,v->b,x),query(v->l,l,m,x));
        return min(f(v->a,v->b,x),query(v->r,m+1,r,x));
    }
    ll query(int x)
    {
        return query(root,0,n,x);
    }
    void rollback()
    {
        prvSz.pop();
        while ((int)stk1.size()>prvSz.top())
        {
            stk1.top()->a = stk2.top()[0];
            stk1.top()->b = stk2.top()[1];
            stk1.pop();
            stk2.pop();
        }
    }
};
 
LiChao lct(1e9);
 
void dfs(int c, int p, int h)
{
    dp[c]=1LL*v[c]*h+s[c]+lct.query(v[c]);
    lct.update(-h,dp[c]);
    for (auto i : e[c])
        if (i[0]!=p)
            dfs(i[0],c,h+i[1]);
    lct.rollback();
}
  
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,x,y,z;
    cin>>n;
    for (int i=1;i<n;++i)
    {
        cin>>x>>y>>z;
        e[x].push_back({y,z});
        e[y].push_back({x,z});
    }
    for (int i=2;i<=n;++i)
        cin>>s[i]>>v[i];
    dfs(1,0,0);
    for (int i=2;i<=n;++i)
        cout<<dp[i]<<" ";
    return 0;
}

• Subtask 1: 60 / 100