Educational Codeforces Round 18 -- D. Paths in a Complete Binary Tree（二叉树模拟）

题意：

给你一棵完全二叉树， 要求从某个结点出发， 开始行走，可以向上走，向左走，向右走， 模拟这个过程。

思路：

观察那个二叉树的形状， 直接二分走就可以找到每一个结点。

我们先找到那个结点，然后从这个结点进行二分模拟行走， 因为有向上走的情况存在，所以可以开一个栈，来维护所走过的路。

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

const int maxn = 1e5+10;
struct Node{
    LL v;
    LL L,R;
    Node(LL v = 0,LL L = 0,LL R = 0):v(v),L(L),R(R){}
};

stack<Node>sk;



char s[maxn];

int main(){

    LL n;
    int q;
    scanf("%lld %d",&n, &q);
    while(q--){
        LL m;
        scanf("%lld%s",&m,s);
        while(!sk.empty()) sk.pop();


        LL l = 1, r = n;
        LL cur = l+r>>1LL;
        while(cur != m){
            sk.push(Node(cur,l,r));
            if (m < cur){
                r = cur-1;
            }
            else l = cur + 1;
            cur = l + r >> 1LL;
        }



        for (int i = 0; s[i]; ++i){
            if (s[i] == 'U'){
                if (sk.empty()) continue;
                else {
                    cur = sk.top().v;
                    l = sk.top().L;
                    r = sk.top().R;
                    sk.pop();

                }
            }
            else {
                if (l == r) continue;
                sk.push(Node(cur,l,r));
                if (s[i] == 'L'){
                    r = cur-1;
                }
                else l = cur+1;
                cur = l + r >> 1LL;
            }
        }
        printf("%lld\n",cur);




    }

    return 0;
}

D. Paths in a Complete Binary Tree

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

T is a complete binary tree consisting of n vertices. It means that exactly one vertex is a root, and each vertex is either a leaf (and doesn't have children) or an inner node (and has exactly two children). All leaves of a complete binary tree have the same depth (distance from the root). So n is a number such that n + 1 is a power of 2.

In the picture you can see a complete binary tree with n = 15.

Vertices are numbered from 1 to n in a special recursive way: we recursively assign numbers to all vertices from the left subtree (if current vertex is not a leaf), then assign a number to the current vertex, and then recursively assign numbers to all vertices from the right subtree (if it exists). In the picture vertices are numbered exactly using this algorithm. It is clear that for each size of a complete binary tree exists exactly one way to give numbers to all vertices. This way of numbering is called symmetric.

You have to write a program that for given n answers q queries to the tree.

Each query consists of an integer number ui (1 ≤ ui ≤ n) and a string si, where ui is the number of vertex, and si represents the path starting from this vertex. String si doesn't contain any characters other than 'L', 'R' and 'U', which mean traverse to the left child, to the right child and to the parent, respectively. Characters from si have to be processed from left to right, considering that ui is the vertex where the path starts. If it's impossible to process a character (for example, to go to the left child of a leaf), then you have to skip it. The answer is the number of vertex where the path represented by si ends.

For example, if ui = 4 and si = «UURL», then the answer is 10.

Input

The first line contains two integer numbers n and q (1 ≤ n ≤ 1018, q ≥ 1). n is such that n + 1 is a power of 2.

The next 2q lines represent queries; each query consists of two consecutive lines. The first of these two lines contains ui (1 ≤ ui ≤ n), the second contains non-empty string si. si doesn't contain any characters other than 'L', 'R' and 'U'.

It is guaranteed that the sum of lengths of si (for each i such that 1 ≤ i ≤ q) doesn't exceed 105.

Output

Print q numbers, i-th number must be the answer to the i-th query.

Example

input

15 2
4
UURL
8
LRLLLLLLLL

output

10
5

Codeforces (c) Copyright 2010-2017 Mi