[bzoj 3672]购票

[bzoj 3672]购票

---

如果是一条链的话是分治然后斜率优化，然后一颗树的情况就换成点分治就行了。

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
const int INF=0x3f3f3f3f;
const long long INF_ll=1000000000000000000;
typedef long long ll;
int n,TYPE;
int cnt,hed[N],to[N<<1],nxt[N<<1];
inline void adde(int u,int v){
    ++cnt;to[cnt]=v,nxt[cnt]=hed[u];hed[u]=cnt;
}
int fa[N];ll dep[N];
int vis[N];
int rt,cursz=INF,S,sz[N];
inline void getroot(int x,int pre){ 
    int mxsz=0;
    sz[x]=1;
    for(int i=hed[x];i;i=nxt[i]){
        int v=to[i];if(vis[v]||v==pre)continue;
        getroot(v,x);
        sz[x]+=sz[v];
        mxsz=max(mxsz,sz[v]);
    }
    mxsz=max(mxsz,S-sz[x]);
    if(mxsz<cursz){
        cursz=mxsz,rt=x;
    }
}
int nd[N],num;
queue<int>Q;
void bfs(int x){
    Q.push(x);
    while(!Q.empty()){
        int u=Q.front();Q.pop();
        nd[++num]=u;
        for(int i=hed[u];i;i=nxt[i]){
            int v=to[i];
            if(vis[v]||v==fa[u])continue;
            Q.push(v);
        }
    }
}
ll f[N];
ll l[N],p[N],q[N];
typedef long double db;
bool cmp(int x,int y){
    return dep[x]-l[x]>=dep[y]-l[y];
}
struct data{ll x,y;};
data stk[N];
int top,pos;

long double calc(data A,data B){return (db)(A.y-B.y)/(db)(A.x-B.x);}
inline void ins(data p){
    while(top>1&&calc(stk[top-1],p)>calc(stk[top-1],stk[top]))top--;
    stk[++top]=p;
}

inline void divide(int x,int stg){
    int szblk=S;
    if(szblk==1){
        f[x]=min(f[x],p[x]*(dep[x]-dep[fa[x]])+q[x]+f[fa[x]]);
        return ;
    }
    int pos=-1;
    for(int i=hed[x];i;i=nxt[i]){int v=to[i];if(!vis[v]&&dep[v]<dep[x])pos=v;}
    vis[x]=stg;
    if(~pos){
        rt=pos,cursz=INF,S=szblk-sz[x];
        getroot(pos,x);
        divide(rt,stg+1);
    }
    num=0;bfs(x);
    /*we pick one more which vis[?]==true,so we don't have to update x first*/
    top=0,pos=x;sort(nd+1,nd+num+1,cmp);
    for(int i=1;i<=num;i++){
        ll low=dep[nd[i]]-l[nd[i]];
        while((!vis[pos]||vis[pos]>=stg||x==pos)&&dep[fa[pos]]>=low&&fa[pos]){
            pos=fa[pos];
            ins((data){dep[pos],f[pos]});
        }
        if(top>0){
            int L=1,R=top;
            while(L<R){
                int mid=(L+R)>>1;
                int k=mid+1;
                ll A=p[nd[i]]*(dep[nd[i]]-stk[mid].x)+q[nd[i]]+stk[mid].y,B=p[nd[i]]*(dep[nd[i]]-stk[k].x)+q[nd[i]]+stk[k].y;
                if(A<B) R=mid;
                else L=mid+1;
            }
            int mid=(L+R)>>1;
            f[nd[i]]=min(f[nd[i]],p[nd[i]]*(dep[nd[i]]-stk[mid].x)+q[nd[i]]+stk[mid].y);
            continue;
        }
    }
    for(int i=hed[x];i;i=nxt[i]){
        int v=to[i];
        if(dep[v]>dep[x]&&!vis[v]){
            S=sz[v],rt=v,cursz=INF;
            getroot(v,x);
            divide(rt,stg+1);
        }
    }
}

int main()
{
    scanf("%d%d",&n,&TYPE);
    for(int i=2;i<=n;i++)f[i]=INF_ll;
    for(int i=2;i<=n;i++){
        ll LEN;
        scanf("%d%lld%lld%lld%lld",&fa[i],&LEN,&p[i],&q[i],&l[i]);
        dep[i]=dep[fa[i]]+LEN;
        adde(fa[i],i),adde(i,fa[i]);
    }
    rt=1,S=n,cursz=INF;
    getroot(1,0);
    rt=1,S=n,cursz=INF;
    divide(1,1);
    for(int i=2;i<=n;i++) 
        printf("%lld\n",f[i]);
}