oj.uz

Submission #440424

# Submission time Handle Problem Language Result Execution time Memory
440424 2021-07-02T09:06:35 Z stoyan_malinin Rack (eJOI19_rack) C++14
0 / 100
 1 ms 204 KB 
#include <iostream>

using namespace std;

long long n, k;

long long getNum(long long pos, int p2, int seqPos)
{
    while(seqPos+(1LL<<(n-1-p2))<=pos)
    {
        seqPos += (1LL<<(n-1-p2));
        p2++;
    }
    if(pos==seqPos) return (1LL<<(p2-1));

    long long nextSeqPos = seqPos+(1LL<<(n-1-p2));
    long long diff = pos - seqPos;

    return getNum(nextSeqPos+diff, p2, seqPos) - (1<<p2);
}

int main()
{
    cin >> n >> k;
    if(k==1)
    {
        cout << "1" << '\n';
        return 0;
    }

    //for(int k = 1;k<=(1<<n);k++)
    cout << getNum(k, 0, 1) << '\n';
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -