제출 #624597

#제출 시각아이디문제언어결과실행 시간메모리
624597BlagojRack (eJOI19_rack)C++14
40 / 100
2 ms2512 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    ll n, k;
    cin >> n >> k;
    vector<ll> v = {1, (1 << (n - 1)) + 1};
    ll sum = (1 << (n - 2));
    if (k == 1)
    {
        cout << 1;
        return 0;
    }
    if (k == 2)
    {
        cout << v[1];
        return 0;
    }
    while (sum > 0)
    {
        ll sz = v.size();
        for (int i = 0; i < sz; i++)
        {
            if ((i + 1) + sz == k)
            {
                cout << v[i] + sum;
                return 0;
            }
            if (sum > 1)
            {
                v.push_back(v[i] + sum);
            }
        }
        sum /= 2;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...