1:QTREE 1
简单描述:
多组数据,维护树上边权,资瓷询问路径最大边权以及修改某个边权.
分析:
简单的树链剖分,转化维护边权为点权,注意初始化
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
const int inf=0x7fffffff;
const int maxm=1e5+100;
int head[maxm],to[maxm<<1],net[maxm<<1],cost[maxm],cnt;
int v[maxm];
int son[maxm],top[maxm],id[maxm],rank[maxm],fa[maxm],deep[maxm],siz[maxm],tot;
int n;
struct node{
int u,v,c;
}edge[maxm];
namespace seg{
int max[maxm<<2];
void pushup(int o)
{
max[o]=std::max(max[(o<<1)],max[(o<<1)|1]);
}
void build(int o,int l,int r)
{
if(l>=r)
{
max[o]=v[rank[l]];
return;
}
int mid=(l+r)>>1;
build((o<<1),l,mid),build((o<<1)|1,mid+1,r);
pushup(o);
}
void change(int o,int l,int r,int ind,int num)
{
if(l>=r)
{
max[o]=num;
return;
}
int mid=(l+r)>>1;
if(ind<=mid) change((o<<1),l,mid,ind,num);
else change((o<<1)|1,mid+1,r,ind,num);
pushup(o);
}
int ask(int o,int l,int r,int ql,int qr)
{
if(ql<=l&&r<=qr) return max[o];
int mid=(l+r)>>1;
int res=0;
if(ql<=mid) res=std::max(res,ask((o<<1),l,mid,ql,qr));
if(qr>mid) res=std::max(res,ask((o<<1)|1,mid+1,r,ql,qr));
return res;
}
int treeask(int u,int v)
{
int ans=0;
while(top[u]!=top[v])
{
if(deep[top[u]]<deep[top[v]]) std::swap(u,v);
ans=std::max(ans,ask(1,1,n,id[top[u]],id[u]));
u=fa[top[u]];
}
if(deep[u]<deep[v]) std::swap(u,v);
ans=std::max(ans,ask(1,1,n,id[v]+1,id[u]));
return ans;
}
}
inline void addedge(int u,int v,int c)
{
cnt++;
to[cnt]=v,cost[cnt]=c,net[cnt]=head[u],head[u]=cnt;
}
void dfs1(int now,int fax,int dep)
{
id[now]=rank[now]=0;
siz[now]=1;
son[now]=0;
fa[now]=fax,deep[now]=dep;
for(int i=head[now];i;i=net[i])
if(to[i]!=fax)
{
dfs1(to[i],now,dep+1);
v[to[i]]=cost[i];
siz[now]+=siz[to[i]];
if(siz[to[i]]>siz[son[now]]) son[now]=to[i];
}
}
void dfs2(int now,int topx)
{
top[now]=topx;
rank[id[now]=++tot]=now;
if(son[now]) dfs2(son[now],topx);
for(int i=head[now];i;i=net[i])
if(!id[to[i]])
dfs2(to[i],to[i]);
}
void work()
{
memset(head,0,sizeof(head));
cnt=0,tot=0;
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int u,v,c;
scanf("%d%d%d",&u,&v,&c);
addedge(u,v,c),addedge(v,u,c);
edge[i]=(node){u,v,c};
}
dfs1(1,1,1),dfs2(1,1);
seg::build(1,1,n);
while(1)
{
char opt[20];
scanf("%s",opt);
if(opt[0]=='D') return;
if(opt[0]=='C')
{
int pos,c;
scanf("%d%d",&pos,&c);
int nowd=deep[edge[pos].u]>deep[edge[pos].v]?edge[pos].u:edge[pos].v;
seg::change(1,1,n,id[nowd],c);
}
else
{
int u,v;
scanf("%d%d",&u,&v);
printf("%d\n",seg::treeask(u,v));
}
}
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
work();
return 0;
}
2:QTREE 2
简单描述:
多组数据,维护树上边权,资瓷询问路径边权和以及路径第K点.
分析:
简单的树链剖分,转化维护边权为点权,对于路径第K点求出LCA进行讨论,注意初始化
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
const int maxm=1e5+100;
int head[maxm],to[maxm<<1],net[maxm<<1],cost[maxm<<1],cnt;
int v[maxm],id[maxm],rank[maxm],tot;
int fa[maxm],deep[maxm],son[maxm],siz[maxm],top[maxm];
int n;
inline void addedge(int u,int v,int c)
{
cnt++;
to[cnt]=v,cost[cnt]=c,net[cnt]=head[u],head[u]=cnt;
}
namespace seg{
int sum[maxm<<2];
void build(int o,int l,int r)
{
if(l>=r)
{
sum[o]=v[rank[l]];
return;
}
int mid=(l+r)>>1;
build((o<<1),l,mid),build((o<<1)|1,mid+1,r);
sum[o]=sum[(o<<1)]+sum[(o<<1)|1];
}
int ask(int o,int l,int r,int ql,int qr)
{
if(ql<=l&&r<=qr) return sum[o];
int mid=(l+r)>>1;
int ans=0;
if(ql<=mid) ans+=ask((o<<1),l,mid,ql,qr);
if(qr>mid) ans+=ask((o<<1)|1,mid+1,r,ql,qr);
return ans;
}
}
using namespace seg;
void dfs1(int now,int fax,int dep)
{
fa[now]=fax,deep[now]=dep;
son[now]=id[now]=rank[now]=0;
siz[now]=1;
for(int i=head[now];i;i=net[i])
if(to[i]!=fax)
{
v[to[i]]=cost[i];
dfs1(to[i],now,dep+1);
siz[now]+=siz[to[i]];
if(siz[to[i]]>siz[son[now]]) son[now]=to[i];
}
}
void dfs2(int now,int topx)
{
rank[id[now]=++tot]=now;
top[now]=topx;
if(son[now]) dfs2(son[now],topx);
for(int i=head[now];i;i=net[i])
if(!id[to[i]]) dfs2(to[i],to[i]);
}
int asklca(int u,int v)
{
while(top[u]!=top[v])
{
if(deep[top[u]]<deep[top[v]]) std::swap(u,v);
u=fa[top[u]];
}
return deep[u]<deep[v]?u:v;
}
int get_kth(int u,int v,int k)
{
int lca=asklca(u,v),tu=top[u],tv=top[v];
if(deep[u]-deep[lca]+1>=k)
{
while(deep[tu]>deep[lca])
{
if(deep[u]-deep[tu]+1>=k) break;
k-=deep[u]-deep[tu]+1;
u=fa[tu];
tu=top[u];
}
return rank[id[u]-k+1];
}
else
{
k-=deep[u]-deep[lca]+1;
k=deep[v]-deep[lca]-k+1;
while(deep[tv]>deep[lca])
{
if(deep[v]-deep[tv]+1>=k) break;
k-=deep[v]-deep[tv]+1;
v=fa[tv];
tv=top[v];
}
return rank[id[v]-k+1];
}
}
int asksum(int u,int v)
{
//printf("%d %d\n",u,v);
int ans=0;
while(top[u]!=top[v])
{
if(deep[top[u]]<deep[top[v]]) std::swap(u,v);
ans+=ask(1,1,n,id[top[u]],id[u]);
u=fa[top[u]];
}
if(deep[u]<deep[v]) std::swap(u,v);
ans+=ask(1,1,n,id[v]+1,id[u]);
return ans;
}
void work()
{
memset(head,0,sizeof(head));
cnt=tot=0;
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int u,v,c;
scanf("%d%d%d",&u,&v,&c);
addedge(u,v,c),addedge(v,u,c);
//printf("%d %d %d\n",u,v,c);
}
dfs1(1,0,1),dfs2(1,1);
build(1,1,n);
while(1)
{
char opt[20];
scanf("%s",opt);
int u,v,k;
if(opt[1]=='O') return;
scanf("%d%d",&u,&v);
if(opt[1]=='T') scanf("%d",&k),printf("%d\n",get_kth(u,v,k));
else printf("%d\n",asksum(u,v));
}
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
work();
return 0;
}
3:QTREE 3 - 1
简单描述:
给出一棵树,初始颜色都为白色。
0 u 对 u 点颜色取反
1 u 查询 1 - u 路径上 深度最小的黑色点
分析:
还是树链剖分,用线段树来维护最小深度的黑点,没有区间操作真的好评!
注意,返回的是树上的点,不是编号
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
const int maxm=1e5+100;
int head[maxm],to[maxm<<1],net[maxm<<1],cost[maxm<<1],cnt;
int v[maxm],id[maxm],rank[maxm],tot;
int fa[maxm],deep[maxm],son[maxm],siz[maxm],top[maxm];
int n;
inline void addedge(int u,int v,int c)
{
cnt++;
to[cnt]=v,cost[cnt]=c,net[cnt]=head[u],head[u]=cnt;
}
namespace seg{
int sum[maxm<<2];
void build(int o,int l,int r)
{
if(l>=r)
{
sum[o]=v[rank[l]];
return;
}
int mid=(l+r)>>1;
build((o<<1),l,mid),build((o<<1)|1,mid+1,r);
sum[o]=sum[(o<<1)]+sum[(o<<1)|1];
}
int ask(int o,int l,int r,int ql,int qr)
{
if(ql<=l&&r<=qr) return sum[o];
int mid=(l+r)>>1;
int ans=0;
if(ql<=mid) ans+=ask((o<<1),l,mid,ql,qr);
if(qr>mid) ans+=ask((o<<1)|1,mid+1,r,ql,qr);
return ans;
}
}
using namespace seg;
void dfs1(int now,int fax,int dep)
{
fa[now]=fax,deep[now]=dep;
son[now]=id[now]=rank[now]=0;
siz[now]=1;
for(int i=head[now];i;i=net[i])
if(to[i]!=fax)
{
v[to[i]]=cost[i];
dfs1(to[i],now,dep+1);
siz[now]+=siz[to[i]];
if(siz[to[i]]>siz[son[now]]) son[now]=to[i];
}
}
void dfs2(int now,int topx)
{
rank[id[now]=++tot]=now;
top[now]=topx;
if(son[now]) dfs2(son[now],topx);
for(int i=head[now];i;i=net[i])
if(!id[to[i]]) dfs2(to[i],to[i]);
}
int asklca(int u,int v)
{
while(top[u]!=top[v])
{
if(deep[top[u]]<deep[top[v]]) std::swap(u,v);
u=fa[top[u]];
}
return deep[u]<deep[v]?u:v;
}
int get_kth(int u,int v,int k)
{
int lca=asklca(u,v),tu=top[u],tv=top[v];
if(deep[u]-deep[lca]+1>=k)
{
while(deep[tu]>deep[lca])
{
if(deep[u]-deep[tu]+1>=k) break;
k-=deep[u]-deep[tu]+1;
u=fa[tu];
tu=top[u];
}
return rank[id[u]-k+1];
}
else
{
k-=deep[u]-deep[lca]+1;
k=deep[v]-deep[lca]-k+1;
while(deep[tv]>deep[lca])
{
if(deep[v]-deep[tv]+1>=k) break;
k-=deep[v]-deep[tv]+1;
v=fa[tv];
tv=top[v];
}
return rank[id[v]-k+1];
}
}
int asksum(int u,int v)
{
//printf("%d %d\n",u,v);
int ans=0;
while(top[u]!=top[v])
{
if(deep[top[u]]<deep[top[v]]) std::swap(u,v);
ans+=ask(1,1,n,id[top[u]],id[u]);
u=fa[top[u]];
}
if(deep[u]<deep[v]) std::swap(u,v);
ans+=ask(1,1,n,id[v]+1,id[u]);
return ans;
}
void work()
{
memset(head,0,sizeof(head));
cnt=tot=0;
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int u,v,c;
scanf("%d%d%d",&u,&v,&c);
addedge(u,v,c),addedge(v,u,c);
//printf("%d %d %d\n",u,v,c);
}
dfs1(1,0,1),dfs2(1,1);
build(1,1,n);
while(1)
{
char opt[20];
scanf("%s",opt);
int u,v,k;
if(opt[1]=='O') return;
scanf("%d%d",&u,&v);
if(opt[1]=='T') scanf("%d",&k),printf("%d\n",get_kth(u,v,k));
else printf("%d\n",asksum(u,v));
}
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
work();
return 0;
}
4:QTREE 3 - 2
简单描述:
给出树,每个点有权值,求 U 子树中大小为K的点
分析:
主席树+DFS序即可
#include <iostream>
#include <cstdio>
#include <algorithm>
#define getid(x) std::lower_bound(hash+1,hash+t+1,val[x])-hash
const int maxm=210005;
int id[maxm],rank[maxm],siz[maxm],tot;
int head[maxm],to[maxm],net[maxm],cnt;
int val[maxm],hash[maxm],pos[maxm];
int n,q;
void addedge(int u,int v)
{
cnt++;
to[cnt]=v,net[cnt]=head[u],head[u]=cnt;
}
void dfs(int now,int fa)
{
rank[id[now]=++tot]=now;
siz[now]=1;
for(int i=head[now];i;i=net[i])
if(to[i]!=fa)
{
dfs(to[i],now);
siz[now]+=siz[to[i]];
}
}
namespace CHT{
int ls[maxm<<2],rs[maxm<<2],sum[maxm],rt[maxm];
int sz;
void insert(int &now,int pre,int l,int r,int ind)
{
//printf("%d %d %d\n",l,r,ind);
now=++sz;
sum[now]=sum[pre]+1;
ls[now]=ls[pre],rs[now]=rs[pre];
if(l>=r) return;
int mid=(l+r)>>1;
if(ind<=mid) insert(ls[now],ls[pre],l,mid,ind);
else insert(rs[now],rs[pre],mid+1,r,ind);
}
int get_kth(int now,int pre,int l,int r,int k)
{
if(l>=r) return l;
int nowsum=sum[ls[now]]-sum[ls[pre]];
//printf("%d %d %d %d %d\n",nowsum,k,now,pre,l);
int mid=(l+r)>>1;
if(k<=nowsum) return get_kth(ls[now],ls[pre],l,mid,k);
else return get_kth(rs[now],rs[pre],mid+1,r,k-nowsum);
}
};
using namespace CHT;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&val[i]),hash[i]=val[i];
std::sort(hash+1,hash+n+1);
int t=std::unique(hash+1,hash+n+1)-hash-1;
for(int i=1;i<n;i++)
{
int u,v;
scanf("%d%d",&u,&v);
addedge(u,v),addedge(v,u);
}
dfs(1,1);
for(int i=1;i<=n;i++)
{
pos[getid(rank[i])]=rank[i];
insert(rt[i],rt[i-1],1,t,getid(rank[i]));
}
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
int u,k;
scanf("%d%d",&u,&k);
printf("%d\n",pos[get_kth(rt[id[u]+siz[u]-1],rt[id[u]-1],1,t,k)]);
}
return 0;
}