[BZOJ4353]Play with tree(树链剖分+线段树)
来源:互联网 发布:动态分配二维数组 编辑:程序博客网 时间:2024/06/05 21:10
题目描述
传送门
题目大意:
给出一棵包含N个节点的树,设每条边一开始的边权为0,现在有两种操作:
1)给出参数U,V,C,表示把U与V之间的路径上的边权变成C(保证C≥0)
2)给出参数U,V,C,表示把U与V之间的路径上的边权加上max(C,路径上边权最小值的相反数)。
你需要统计出每次一操作过后树中边权为0的边有多少条。
题解
线段树维护区间最小值,区间最小值的个数,区间中为0的数的个数
好想好写,细节比较多。。
代码
#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>#include<cmath>using namespace std;#define N 100005#define inf 1000000000int n,m,dfs_clock,Min,Sum0;int tot,point[N],nxt[N<<1],v[N<<1];int father[N],son[N],size[N],h[N],top[N],num[N];int minn[N<<2],sum0[N<<2],sum[N<<2],cover[N<<2],delta[N<<2];void add(int x,int y){++tot;nxt[tot]=point[x];point[x]=tot;v[tot]=y;}void dfs_1(int x,int fa){ size[x]=1;father[x]=fa;h[x]=h[fa]+1; for (int i=point[x];i;i=nxt[i]) if (v[i]!=fa) { dfs_1(v[i],x); size[x]+=size[v[i]]; if (size[v[i]]>size[son[x]]) son[x]=v[i]; }}void dfs_2(int x,int fa){ if (x==son[fa]) top[x]=top[fa]; else top[x]=x; num[x]=++dfs_clock; if (son[x]) dfs_2(son[x],x); for (int i=point[x];i;i=nxt[i]) if (v[i]!=fa&&v[i]!=son[x]) dfs_2(v[i],x);}void update(int now){ sum0[now]=sum0[now<<1]+sum0[now<<1|1]; if (minn[now<<1]==minn[now<<1|1]) { minn[now]=minn[now<<1]; sum[now]=sum[now<<1]+sum[now<<1|1]; } else if (minn[now<<1]<minn[now<<1|1]) { minn[now]=minn[now<<1]; sum[now]=sum[now<<1]; } else { minn[now]=minn[now<<1|1]; sum[now]=sum[now<<1|1]; }}void pushdown(int now,int l,int r,int mid){ if (cover[now]!=inf) { minn[now<<1]=cover[now<<1]=cover[now];delta[now<<1]=0; sum[now<<1]=mid-l+1; if (!minn[now<<1]) sum0[now<<1]=mid-l+1; else sum0[now<<1]=0; minn[now<<1|1]=cover[now<<1|1]=cover[now];delta[now<<1|1]=0; sum[now<<1|1]=r-mid; if (!minn[now<<1|1]) sum0[now<<1|1]=r-mid; else sum0[now<<1|1]=0; cover[now]=inf; } if (delta[now]) { minn[now<<1]+=delta[now];minn[now<<1|1]+=delta[now]; if (!minn[now<<1]) sum0[now<<1]=sum[now<<1]; else sum0[now<<1]=0; if (!minn[now<<1|1]) sum0[now<<1|1]=sum[now<<1|1]; else sum0[now<<1|1]=0; if (cover[now<<1]!=inf) cover[now<<1]+=delta[now]; else delta[now<<1]+=delta[now]; if (cover[now<<1|1]!=inf) cover[now<<1|1]+=delta[now]; else delta[now<<1|1]+=delta[now]; delta[now]=0; }}void build(int now,int l,int r){ int mid=(l+r)>>1;cover[now]=inf; if (l==r) { if (l!=1) minn[now]=0,sum0[now]=sum[now]=r-l+1; else minn[now]=inf,sum0[now]=sum[now]=0; return; } build(now<<1,l,mid); build(now<<1|1,mid+1,r); update(now);}void change(int now,int l,int r,int lr,int rr,int x,int opt){ if (lr>rr) return; int mid=(l+r)>>1; if (lr<=l&&r<=rr) { if (opt==1) { minn[now]=x;sum[now]=r-l+1; if (!minn[now]) sum0[now]=r-l+1; else sum0[now]=0; cover[now]=x;delta[now]=0; } else { minn[now]+=x; if (!minn[now]) sum0[now]=sum[now]; else sum0[now]=0; if (cover[now]!=inf) cover[now]+=x; else delta[now]+=x; } return; } pushdown(now,l,r,mid); if (lr<=mid) change(now<<1,l,mid,lr,rr,x,opt); if (mid+1<=rr) change(now<<1|1,mid+1,r,lr,rr,x,opt); update(now);}int query(int now,int l,int r,int lr,int rr){ if (lr>rr) return inf; int mid=(l+r)>>1,ans=inf; if (lr<=l&&r<=rr) return minn[now]; pushdown(now,l,r,mid); if (lr<=mid) ans=min(ans,query(now<<1,l,mid,lr,rr)); if (mid+1<=rr) ans=min(ans,query(now<<1|1,mid+1,r,lr,rr)); return ans;}void CHANGE(int x,int y,int c,int opt){ int f1=top[x],f2=top[y]; while (f1!=f2) { if (h[f1]<h[f2]) { swap(f1,f2); swap(x,y); } change(1,1,n,num[f1],num[x],c,opt); x=father[f1]; f1=top[x]; } if (num[x]>num[y]) swap(x,y); change(1,1,n,num[x]+1,num[y],c,opt);}int QUERY(int x,int y){ int f1=top[x],f2=top[y],ans=inf; while (f1!=f2) { if (h[f1]<h[f2]) { swap(f1,f2); swap(x,y); } ans=min(ans,query(1,1,n,num[f1],num[x])); x=father[f1]; f1=top[x]; } if (num[x]>num[y]) swap(x,y); ans=min(ans,query(1,1,n,num[x]+1,num[y])); return ans;}int main(){ scanf("%d%d",&n,&m); for (int i=1;i<n;++i) { int x,y;scanf("%d%d",&x,&y); add(x,y),add(y,x); } dfs_1(1,0); dfs_2(1,0); build(1,1,n); while (m--) { int opt,x,y,c;scanf("%d%d%d%d",&opt,&x,&y,&c); if (opt==1) CHANGE(x,y,c,1); else { Min=QUERY(x,y); if (Min+c<0) c=-Min; CHANGE(x,y,c,2); } printf("%d\n",sum0[1]); }}
0 0
- 【BZOJ4353】Play with tree,树链剖分线段树
- [BZOJ4353]Play with tree(树链剖分+线段树)
- 【Bzoj4353】play with tree
- bzoj 4353: Play with tree (树链剖分)
- bzoj 4355: Play with sequence (线段树)
- HDU 3971. Play With Sequence【线段树+排序】
- 【 bzoj 4355 】 Play with sequence - 线段树乱搞
- [BZOJ4355]Play with sequence 吉司机线段树
- hdu 3487 Play with Chain(splay tree)
- HDU 3487——Play with Chain(splay tree)
- HDOJ 题目3487 Play with Chain(Splay Tree)
- HDU 3487 Play with Chain (Splay tree)
- hdu-3487-Play with Chain (Splay tree)
- 【splay tree】 HDOJ 3487 Play with Chain
- hdu 3487 Play with Chain splay tree
- hdu 3487 Play with Chain splay tree
- POJ 3237 Tree(树链剖分+线段树)
- POJ 3237 Tree (树链剖分+线段树)
- 环境变量配置window7和window10
- [ASIFT 1] Load images
- CCF NOI1046 打印方阵
- Bmob移动支付学习Demo
- c++ socket 异步编程
- [BZOJ4353]Play with tree(树链剖分+线段树)
- 我如何从一个本科双非报考帝都985最后调剂到帝都221的故事
- 【正一专栏】从人民的名义看失败的婚姻关系
- 【正一专栏】一直的梦想——我的读书记
- NYOJ 248
- CentOS 7 源码编译mysql5.7.11 ,如果在阿里云内存不足编译失败处理方法
- Javascript面向对象(八)——Class
- tiny6410的MMU的配置于使用
- 用户登入记住密码案例