hdu 6191--Query on A Tree(持久化字典树)
2018-06-17 21:44:43来源:未知 阅读 ()
题目链接
One day, monkey A learned about one of the bit-operations, xor. He was keen of this interesting operation and wanted to practise it at once.
Monkey A gave a value to each node on the tree. And he was curious about a problem.
The problem is how large the xor result of number x and one node value of label y can be, when giving you a non-negative integer x and a node label u indicates that node y is in the subtree whose root is u(y can be equal to u).
Can you help him?
For each test case there are two positive integers n and q, indicate that the tree has n nodes and you need to answer q queries.
Then two lines follow.
The first line contains n non-negative integers V1,V2,?,Vn, indicating the value of node i.
The second line contains n-1 non-negative integers F1,F2,?Fn−1, Fi means the father of node i+1.
And then q lines follow.
In the i-th line, there are two integers u and x, indicating that the node you pick should be in the subtree of u, and x has been described in the problem.
2≤n,q≤105
0≤Vi≤109
1≤Fi≤n, the root of the tree is node 1.
1≤u≤n,0≤x≤109
#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> #include <vector> using namespace std; const int N=1e5+5; int a[N]; struct Node { int son[2]; int sum[2]; }node[35*N]; vector<int>G[N]; int la[N],to[N],root[N]; int tot1,tot2; void init() { node[0].son[0]=node[0].son[1]=0; node[0].sum[0]=node[0].sum[1]=0; root[0]=0; tot1=tot2=0; for(int i=1;i<N;i++) G[i].clear(); } void build(int pre,int now,int x,int deep) { if(deep<0) return ; int tmp=!!(x&(1<<deep)); node[now]=node[pre]; node[now].sum[tmp]++; build(node[pre].son[tmp],node[now].son[tmp]=++tot2,x,deep-1); } void dfs(int now) { la[now]=++tot1; build(root[la[now]-1],root[la[now]]=++tot2,a[now],30); for(int i=0;i<G[now].size();i++) { int v=G[now][i]; dfs(v); } to[now]=tot1; } int query(int pre,int now,int sum,int x,int deep) { if(deep<0) return sum; int tmp=!!(x&(1<<deep)); if(node[now].sum[tmp^1]>node[pre].sum[tmp^1]) return query(node[pre].son[tmp^1],node[now].son[tmp^1],sum|(1<<deep),x,deep-1); return query(node[pre].son[tmp],node[now].son[tmp],sum,x,deep-1); } int main() { int n,q; while(scanf("%d%d",&n,&q)!=EOF) { init(); for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=2;i<=n;i++) { int x; scanf("%d",&x); G[x].push_back(i); } dfs(1); while(q--) { int u,x; scanf("%d%d",&u,&x); printf("%d\n",query(root[la[u]-1],root[to[u]],0,x,30)); } } return 0; }
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
上一篇:明明的随机数
- HDU-2955-Robberies(0-1背包) 2020-03-30
- Maximum White Subtree 2020-03-26
- hdu1455 拼木棍(经典dfs) 2020-02-29
- STL中_Rb_tree的探索 2020-02-20
- 二叉树(5)HuffmanTree 2020-02-19
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash