Binary Tree
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7322 | Accepted: 3353 |
Description
Background
Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this:
Problem
Given the contents (a, b) of some node of the binary tree described above, suppose you are walking from the root of the tree to the given node along the shortest possible path. Can you find out how often you have to go to a left child and how often to a right child?
Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this:
- The root contains the pair (1, 1).
- If a node contains (a, b) then its left child contains (a + b, b) and its right child (a, a + b)
Problem
Given the contents (a, b) of some node of the binary tree described above, suppose you are walking from the root of the tree to the given node along the shortest possible path. Can you find out how often you have to go to a left child and how often to a right child?
Input
The first line contains the number of scenarios.
Every scenario consists of a single line containing two integers i and j (1 <= i, j <= 2*10 9) that represent
a node (i, j). You can assume that this is a valid node in the binary tree described above.
Every scenario consists of a single line containing two integers i and j (1 <= i, j <= 2*10 9) that represent
a node (i, j). You can assume that this is a valid node in the binary tree described above.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing two numbers l and r separated by a single space, where l is how often you have to go left and r is how often you have to go right when traversing the tree from the root to the node given in the input. Print an empty line after every scenario.
Sample Input
3 42 1 3 4 17 73
Sample Output
Scenario #1: 41 0 Scenario #2: 2 1 Scenario #3: 4 6
tips:虽然题目是二叉树,却是一道数学题。
逆向思维,从(l,r)到(1,1)。给定(l,r),求其父亲,如果l>r,则他父亲是(l-r,r),反之则(l,r-l)。
时间复杂度为树高。但是因为数据量比较大,我们可以优化一下。
具体为用除法代替减法,具体来说:
就是当出现多个分支连续往左或者往右,这时就可以使用除法加快速度。
特判:出的过程中,余数可能为0;#include<iostream> #include<cstring> using namespace std; int cntl,cntr,l,r; int main() { int k;cin>>k; for(int i=1;i<=k;i++) { cout<<"Scenario #"<<i<<":"<<endl; cin>>l>>r;cntl=cntr=0; while(l!=1||r!=1) { if(l>r) { cntl+=(l/r); l%=r; if(l==0)cntl--,l=1;//特判 } else{ cntr+=(r/l); r%=l; if(r==0)cntr--,r=1;//特判 } } cout<<cntl<<" "<<cntr<<endl<<endl;; } return 0; }