oj.uz

Submission #999708

# Submission time Handle Problem Language Result Execution time Memory
999708 2024-06-16T05:39:52 Z HasanV11010238 Rack (eJOI19_rack) C++17
40 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int am = 0;
ll binpow(ll a, ll b){
    ll res = 1;
    if (b == -1){
        return 0;
    }
    while (b != 0){
        if (b % 2 == 0){
            b /= 2;
            a *= a;
            a %= mod;
        }
        else{
            b -= 1;
            res *= a;
            res %= mod;
        }
    }
    return res;
}
vector<vector<ll>> ve;
ll ans = 1;
ll f(ll n, ll k, ll va){
    ll val = 0;
    if (n == 0){
        return 0;
    }
    am = 0;
    
    if (n <= 63){
        ll op = pow(2, n - 1);
        if (k >= op){
            val += binpow(2, va);
            f(n - 1, k - op, va + 1);
            ans += val;
            return 0;
        }
    }
    f(n - 1, k, va + 1);
    ans += val;
    return 0;
}
int main(){
    ll n, k;
    cin>>n>>k;
    k--;
    f(n, k, 0);
    printf("%lld", ans);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -