UVA 679 Drop 完全二叉树
2015-08-20 15:42
274 查看
对于一个结点k,其左子结点、右子结点的编号分别是2k和2k+1
A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either follows
the path of the left subtree, or follows the path of the right subtree, until it stops at one of the leaf nodes of FBT. To determine a ball's moving direction a flag is set up in every non-terminal node with two values, eitherfalse or true.
Initially, all of the flags are false. When visiting a non-terminal node if the flag's current value at this node is false, then the ball will first switch this flag's value, i.e., from thefalse to the true,
and then follow the left subtree of this node to keep moving down. Otherwise, it will also switch this flag's value, i.e., from the true to the false, but will follow the right subtree of this node to keep moving down. Furthermore,
all nodes of FBT are sequentially numbered, starting at 1 with nodes on depth 1, and then those on depth 2, and so on. Nodes on any depth are numbered from left to right.
For example, Fig. 1 represents a fully binary tree of maximum depth 4 with the node numbers 1, 2, 3, ..., 15. Since all of the flags are initially set to be false, the first ball being dropped will switch flag's values at node 1, node 2, and
node 4 before it finally stops at position 8. The second ball being dropped will switch flag's values at node 1, node 3, and node 6, and stop at position 12. Obviously, the third ball being dropped will switch flag's values at node 1, node 2, and node 5 before
it stops at position 10.
![](https://uva.onlinejudge.org/external/6/p679.gif)
Fig. 1: An example of FBT with the maximum depth 4 and sequential node numbers.
Now consider a number of test cases where two values will be given for each test. The first value is D, the maximum depth of FBT, and the second one is I, the Ith ball being dropped. You may assume the value of Iwill
not exceed the total number of leaf nodes for the given FBT.
Please write a program to determine the stop position P for each test case.
For each test cases the range of two parameters D and I is as below:
![](https://uva.onlinejudge.org/external/6/679img1.gif)
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int a,b;
cin>>a>>b;
int k=1;
for(int i=0;i<a-1;i++)
{
if(b%2==0)
{
k=k*2+1;
b=b/2;
}
else
{
k=k*2;
b=(b+1)/2;
}
}
cout<<k<<endl;
}
int f;
cin>>f;
}
A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either follows
the path of the left subtree, or follows the path of the right subtree, until it stops at one of the leaf nodes of FBT. To determine a ball's moving direction a flag is set up in every non-terminal node with two values, eitherfalse or true.
Initially, all of the flags are false. When visiting a non-terminal node if the flag's current value at this node is false, then the ball will first switch this flag's value, i.e., from thefalse to the true,
and then follow the left subtree of this node to keep moving down. Otherwise, it will also switch this flag's value, i.e., from the true to the false, but will follow the right subtree of this node to keep moving down. Furthermore,
all nodes of FBT are sequentially numbered, starting at 1 with nodes on depth 1, and then those on depth 2, and so on. Nodes on any depth are numbered from left to right.
For example, Fig. 1 represents a fully binary tree of maximum depth 4 with the node numbers 1, 2, 3, ..., 15. Since all of the flags are initially set to be false, the first ball being dropped will switch flag's values at node 1, node 2, and
node 4 before it finally stops at position 8. The second ball being dropped will switch flag's values at node 1, node 3, and node 6, and stop at position 12. Obviously, the third ball being dropped will switch flag's values at node 1, node 2, and node 5 before
it stops at position 10.
![](https://uva.onlinejudge.org/external/6/p679.gif)
Fig. 1: An example of FBT with the maximum depth 4 and sequential node numbers.
Now consider a number of test cases where two values will be given for each test. The first value is D, the maximum depth of FBT, and the second one is I, the Ith ball being dropped. You may assume the value of Iwill
not exceed the total number of leaf nodes for the given FBT.
Please write a program to determine the stop position P for each test case.
For each test cases the range of two parameters D and I is as below:
![](https://uva.onlinejudge.org/external/6/679img1.gif)
Input
Contains l+2 lines.Line 1 I the number of test cases Line 2 test case #1, two decimal numbers that are separatedby one blank ... Line k+1 test case #k Line l+1 test case #l Line l+2 -1 a constant -1 representing the end of the input file
Output
Contains l lines.Line 1 the stop position P for the test case #1 ... Line k the stop position P for the test case #k ... Line l the stop position P for the test case #l
Sample Input
5 4 2 3 4 10 1 2 2 8 128 -1
Sample Output
12 7 512 3 255
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int a,b;
cin>>a>>b;
int k=1;
for(int i=0;i<a-1;i++)
{
if(b%2==0)
{
k=k*2+1;
b=b/2;
}
else
{
k=k*2;
b=(b+1)/2;
}
}
cout<<k<<endl;
}
int f;
cin>>f;
}
相关文章推荐
- Atitit.ati orm的设计and架构总结 适用于java c# php版
- ssh-copy-id用法
- Atitit.ati orm的设计and架构总结 适用于java c# php版
- Atitit.ati orm的设计and架构总结 适用于java c# php版
- windows下搭建hadoop-2.6.0本地idea开发环境
- 给虚拟机中的CentOS7配置固定ip
- Linux概况和基础
- Hadoop-2.2.0中国文献—— Web应用代理
- Linux LVS-DR模型实战演示
- Linux 常用命令
- 架构设计中的6种常见安全误区
- fedora/centos下gcc编译出现gcc: error trying to exec ‘cc1plus’: execvp: No such file or directory
- linux 一天一个命令之'cut'
- Linux 格式化磁盘命令mkfs
- php获得网站根目录的几个方法
- linux下创建和删除软、硬链接
- CentOS 6.3 64位 搭建SVNServer服务器
- linux下搭建gsoap环境
- Powershell Module for Netapp Data Ontap
- Powershell Module for Netapp Data Ontap