oj.uz

Submission #579218

# Submission time Handle Problem Language Result Execution time Memory
579218 2022-06-18T13:34:20 Z Kipras Rack (eJOI19_rack) C++17
0 / 100
 8 ms 8148 KB 
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

const ll mod = 1e9+7;
const ll maxN = 1e6+10;

ll secondPower[maxN];

void gen(){
    secondPower[0]=1;
    for(int i = 1; i < maxN; i++)secondPower[i]=(secondPower[i-1]*2)%mod;
}

int main()
{

    ios_base::sync_with_stdio(0);cin.tie(nullptr);

    gen();

    ll n, k;
    cin>>n>>k;

    ll res=1;

    for(int i = n-1; i > 0; i--){
        if(k%2==1){
            k=k/2+1;
            //res=(res+secondPower[i])%mod;
        }else{
            k=k/2;
            res=(res+secondPower[i])%mod;
        }
    }

    cout<<res;

    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 60.0

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