제출 #439722

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

rack

#include <iostream>

using namespace std;

const long long mod = 1e9 + 7;

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

long long revNum(long long x, int bitCnt)
{
    long long res = 0;
    for(int bit = 0;bit<bitCnt;bit++)
        res += (((x>>bit)&1)<<(bitCnt-bit-1));
    
    return res;
}

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;
    }   

    long long start = (1LL<<(layer-1));
    long long kLeft = k - ((1LL<<(layer-1)) - 1) - 1;
    long long node = start + revNum(kLeft, layer-1);

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

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