nekopara

题目描述

树链剖分

把边和询问放在一起按照权值排序，权值相同询问优先。
假如树上每条边都用01表示是否超过当前limit。
扫到一条边，就是把对应边从0变成1。
扫到一个询问，就直接询问了。
树链剖分，线段树维护区间长度、答案、左边/右边的连续1个数。
然后就可做了。

#include<cstdio>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100000+10;
struct dong{
    int x,c,lc,rc;
} tree[maxn*4];
int key[maxn],d[maxn],size[maxn],dfn[maxn],nfd[maxn],jump[maxn],h[maxn],go[maxn*2],next[maxn*2];
int f[maxn][25];
struct suan{
    int x,y,l,id;
    bool p;
} ask[maxn*2];
dong now,won;
int ans[maxn];
int i,j,k,l,t,n,m,tot,top,u,v,w;
void merge(dong a,dong b,dong &c){
    c.x=a.x+b.x-key[a.rc]-key[b.lc]+key[a.rc+b.lc];
    c.c=a.c+b.c;
    if (a.lc==a.c) c.lc=a.c+b.lc;else c.lc=a.lc;
    if (b.rc==b.c) c.rc=b.c+a.rc;else c.rc=b.rc;
}
void build(int p,int l,int r){
    tree[p].c=r-l+1;
    if (l==r) return;
    int mid=(l+r)/2;
    build(p*2,l,mid);
    build(p*2+1,mid+1,r);
    merge(tree[p*2],tree[p*2+1],tree[p]);
}
void change(int p,int l,int r,int a){
    if (l==r){
        tree[p].x=key[1];
        tree[p].c=tree[p].lc=tree[p].rc=1;
        return;
    }
    int mid=(l+r)/2;
    if (a<=mid) change(p*2,l,mid,a);else change(p*2+1,mid+1,r,a);
    merge(tree[p*2],tree[p*2+1],tree[p]);
}
void query(int p,int l,int r,int a,int b){
    if (a>b) return;
    if (l==a&&r==b){
        merge(tree[p],now,now);
        return;
    }
    int mid=(l+r)/2;
    if (b<=mid) query(p*2,l,mid,a,b);
    else if (a>mid) query(p*2+1,mid+1,r,a,b);
    else{
        query(p*2+1,mid+1,r,mid+1,b);
        query(p*2,l,mid,a,mid);
    }
}
void add(int x,int y){
    go[++tot]=y;
    next[tot]=h[x];
    h[x]=tot;
}
void dfs(int x,int y){
    d[x]=d[y]+1;
    f[x][0]=y;
    size[x]=1;
    int t=h[x];
    while (t){
        if (go[t]!=y){
            dfs(go[t],x);
            size[x]+=size[go[t]];
        }
        t=next[t];
    }
}
void dg(int x,int y){
    dfn[x]=++top;
    nfd[top]=x;
    int t=h[x],l=0;
    while (t){
        if (go[t]!=y&&!l||size[go[t]]>size[l]) l=go[t];
        t=next[t];
    }
    if (l){
        jump[l]=jump[x];
        dg(l,x);
    }
    t=h[x];
    while (t){
        if (go[t]!=l&&go[t]!=y){
            jump[go[t]]=go[t];
            dg(go[t],x);
        }
        t=next[t];
    }
}
int lca(int x,int y){
    int j;
    if (d[x]!=d[y]){
        if (d[x]<d[y]) swap(x,y);
        j=floor(log(n)/log(2));
        while (j>=0){
            if (d[f[x][j]]>d[y]) x=f[x][j];
            j--;
        }
        x=f[x][0];
    }
    if (x==y) return x;
    j=floor(log(n)/log(2));
    while (j>=0){
        if (f[x][j]!=f[y][j]){
            x=f[x][j];
            y=f[y][j];
        }
        j--;
    }
    return f[x][0];
}
int read(){
    int x=0,f=1;
    char ch=getchar();
    while (ch<'0'||ch>'9'){
        if (ch=='-') f=-1;
        ch=getchar();
    }
    while (ch>='0'&&ch<='9'){
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}
bool cmp(suan a,suan b){
    if (a.l>b.l) return 1;
    else if (a.l==b.l&&a.p>b.p) return 1;
    else return 0;
}
int main(){
    freopen("nekopara2.in","r",stdin);freopen("nekopara.out","w",stdout);
    n=read();
    fo(i,1,n-1) key[i]=read();
    fo(i,1,n-1){
        ask[i].x=read();
        ask[i].y=read();
        ask[i].x++;ask[i].y++;
        ask[i].l=read();
        ask[i].p=0;
        add(ask[i].x,ask[i].y);
        add(ask[i].y,ask[i].x);
    }
    dfs(1,0);
    dg(1,0);
    fo(j,1,floor(log(n)/log(2)))
        fo(i,1,n) 
            f[i][j]=f[f[i][j-1]][j-1];
    build(1,1,n);
    m=read();
    fo(i,1,m){
        ask[i+n-1].x=read();
        ask[i+n-1].y=read();
        ask[i+n-1].x++;ask[i+n-1].y++;
        ask[i+n-1].l=read();
        ask[i+n-1].id=i;
        ask[i+n-1].p=1;
    }
    sort(ask+1,ask+n+m,cmp);
    fo(i,1,n+m-1)
        if (ask[i].p){
            now.x=now.c=now.lc=now.rc=0;
            u=ask[i].x;v=ask[i].y;
            w=lca(u,v);
            while (u!=w){
                k=jump[u];
                if (d[k]<=d[w]) k=nfd[dfn[w]+1];
                query(1,1,n,dfn[k],dfn[u]);
                u=f[k][0];
            }
            won=now;
            now.x=now.c=now.lc=now.rc=0;
            while (v!=w){
                k=jump[v];
                if (d[k]<=d[w]) k=nfd[dfn[w]+1];
                query(1,1,n,dfn[k],dfn[v]);
                v=f[k][0];
            }
            swap(won.lc,won.rc);
            merge(won,now,now);
            ans[ask[i].id]=now.x;
        }
        else{
            if (d[ask[i].x]>d[ask[i].y]) swap(ask[i].x,ask[i].y);
            change(1,1,n,dfn[ask[i].y]);
        }
    fo(i,1,m) printf("%d\n",ans[i]);
    fclose(stdin);fclose(stdout);
    return 0;
}