제출 #439712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439712		stoyan_malinin	Rack (eJOI19_rack)	C++14	0 / 100	1 ms	292 KiB

rack

#include <iostream>

using namespace std;

long long walkLeft(long long node, int layer, int n)
{
    if(layer==n+1) return node;
    return walkLeft(node*2, layer+1, n);
}

int main()
{
    long long n, k;
    cin >> n >> k;

    if(k==1)
    {
        cout << "1" << '\n';
        return 0;
    }
    k--;

    int layer;
    for(layer = 1;layer<=n;layer++)
    {
        long long maxNum = (1LL<<(layer)) - 1;
        if(k<=maxNum) break;
    }   

    //cout << layer << '\n';

    long long start = (1LL<<(layer-1));
    long long kLeft = k - ((1LL<<(layer-1)) - 1) - 1;
    long long node = start + kLeft / 2;
    if(kLeft%2!=0) node += ((1LL<<(layer-2)));
    
    //cout << start << " " << kLeft << '\n';
    //cout << node << '\n';

    cout << walkLeft(node*2+1, layer+1, n) - (1LL<<n) + 1 << '\n';
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 60