Codeforces Round #287 (Div. 2) C. Guess Your Way Out! ACM解题报告（二叉树）

有啥好说的呢，仔细加不要想太复杂。（照我这渣水平何年何月上紫呢。。）

• Character 'L' means "go to the left child of the current node";
• Character 'R' means "go to the right child of the current node";
• If the destination node is already visited, Amr skips current command, otherwise he moves to the destination node;
• If Amr skipped two consecutive commands, he goes back to the parent of the current node before executing next command;
• If he reached a leaf node that is not the exit, he returns to the parent of the current node;
• If he reaches an exit, the game is finished.

Now Amr wonders, if he follows this algorithm, how many nodes he is going to visit before reaching the exit?

出口在左子树，指令是L

出口在左子树，指令是R

出口在右子树，指令是L

出口在右子树，指令是R

#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long LL;
LL solve(LL s,LL k,char c)
{
    if(s==0) return 0;
    LL x=1LL<<(s-1);
    LL temp;
    if(c=='L')
    {
        if(k>x) temp=2*x+solve(s-1,k-x,'L');
        else temp=1LL+solve(s-1,k,'R');
    }
    else
    {
        if(k<=x) temp=2*x+solve(s-1,k,'R');
        else temp=1LL+solve(s-1,k-x,'L');
    }
    return temp;
}
int main()
{
    LL h,n;
    scanf("%I64d%I64d",&h,&n);
    LL ans=solve(h,n,'L');
    printf("%I64d\n",ans);
    return 0;
}