Ultraviolet A 679-dropping bils

A numberKBils 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, eitherFalseOrTrue. Initially, all of the flags areFalse. When visiting a non-terminal node if the flag's current value at this node isFalse, Then the ball will first switch this flag's value, I. e., fromFalseToTrue, And then follow the left subtree of this node to keep moving down. Otherwise, it will also switch this flag's value, I. e., fromTrueToFalse, 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 beFalse, 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. obviusly, the third ball being dropped will switch flag'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 sequential node numbers.

Now consider a number of test cases where two values will be given for each test. The first value isD, The maximum depth of FBT, and the second one isI,IThBall being dropped. You may assume the valueIWill not exceed the total number of leaf nodes for the given FBT.

Please write a program to determine the stop positionPFor each test case.

For each test cases the range of Two ParametersDAndIIs as below:

Input

ContainsL+ 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

ContainsLLines.

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

54 23 410 12 28 128-1

Sample output

1275123255

First, consider that the ball falls to the root node. The first will fall to the left subtree, the second to the right subtree, and the third to the left subtree .. If I is an even number, it falls to the left, the odd number falls to the right, and the number that falls to the left is half the number on the right.

#include <stdio.h>#include <string.h>#include <math.h>#include <iostream>#include <queue>#include <algorithm>#define mem(f) memset(f,0,sizeof(f))#define M 100005#define mod 1000000007#define lson o<<1, l, m#define rson o<<1|1, m+1, rusing namespace std;typedef long long LL;const int MAX = 0x3f3f3f3f;const int maxn = 2111111;int n, m, d;int main(){    while(~scanf("%d", &n) && n != -1) {        while(n--) {            scanf("%d%d", &d, &m);            int k = 1;            for(int i = 0; i < d-1; i++) {                if(m%2) {                    k = 2*k;                    m = (m+1)/2;                } else {                    k = 2*k+1;                    m = m/2;                }            }            printf("%d\n", k);        }    }    return 0;}

Zookeeper

Ultraviolet A 679-dropping bils