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 theright subtree, until it stops at one of the leaf nodes of FBT. To determine aball's moving direction a flag is set up in every non-terminal node with twovalues, either false or true. Initially, all of the flags arefalse. When visiting a non-terminal node if the flag's current value atthis node is false, then the ball will first switch this flag's value,i.e., from the false to the true, and then follow the left subtreeof this node to keep moving down. Otherwise, it will also switch this flag'svalue, i.e., from the true to the false, but will follow the rightsubtree of this node to keep moving down. Furthermore, all nodes of FBT aresequentially numbered, starting at 1 with nodes on depth 1, and then those ondepth 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 withthe node numbers 1, 2, 3, ..., 15. Since all of the flags are initially set tobe false, the first ball being dropped will switch flag's values at node1, node 2, and node 4 before it finally stops at position 8. The second ballbeing dropped will switch flag's values at node 1, node 3, and node 6, andstop at position 12. Obviously, the third ball being dropped will switchflag's values at node 1, node 2, and node 5 before it stops at position 10.
Fig. 1: An example of FBT with the maximum depth 4 and sequentialnode numbers.
Now consider a number of test cases where two values will be given for each test. Thefirst 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 I will notexceed the total number of leaf nodes for the given FBT.
Please write a program to determine the stop position P foreach test case.
For each test cases the range of two parameters D and I is as below:
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
题意:
一棵二叉数,最大的深度为D,且所有的叶子深度相同,从上到下从左到右一次编号为1,2,3,…… 2^D - 1;
在结点一时放一个小球,它会往下落,初始的开关都是关闭的,每一次的下落都会改变其开关的状态,如果开关
关闭则往左走,否则往右走。直至叶子的终点;输出I小球的最后所在的叶子编号;
#include<cstdio>
#include<iostream>
#include<cstring>
#define N 20
using namespace std;
int s[1 << N];
int main(){
int D;
int I;
int n;
int k;
while(scanf("%d",&n) != EOF)
{
if(n == -1)
break;
while(n --)
{
cin >> D >> I ;
memset(s,0,sizeof(s));
int n = (1 << D )- 1;
for(int i = 0;i < I;i ++)
{
k = 1;
for(;;)
{
s[k] = !s[k];//开关的状态
k = s[k] ? 2*k : 2*k + 1;
if(k > n)
break;
}
}
printf("%d\n",k/2);
}
}
return 0 ;
}
方法二:
小球的编号I为偶数时,向右走 I / 2 个小球,I 为奇数时 向左 (I + 2) / 2个小球
#include<cstdio>
#include<iostream>
int main()
{
int n,d,t,i;
while(scanf("%d",&n)==1)
{
if(n==-1)
break;
for(i=0;i<n;i++)
{
int k=1;
scanf("%d %d",&d,&t);
for(int j=1;j<d;j++)
{
if(t%2) {
k=2*k;t=(t+1)/2;
}
else
{
k=2*k+1;
t=t/2;
}
}
printf("%d\n",k);
}
}
}