oj.uz

Submission #1086834

# Submission time Handle Problem Language Result Execution time Memory
1086834 2024-09-11T14:47:31 Z steveonalex Rack (eJOI19_rack) C++17
100 / 100
 4 ms 4368 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int MOD = 1e9 + 7;
const int N = 1e6 + 69;
int pw2[N];

int get(ll n, ll k){
    if (n == 0) return k;
    if (k % 2) {
        return get(n-1, k / 2 + 1);
    }
    else return (get(n-1, k/2) + pw2[n-1]) % MOD;
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    pw2[0] = 1;
    for(int i = 1; i<N; ++i){
        pw2[i] = pw2[i-1] * 2;
        if (pw2[i] >= MOD) pw2[i] -= MOD;
    }
 
    ll n, k; cin >> n >> k;

    cout << get(n, k) << "\n";

 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4188 KB Output is correct
2 Correct 3 ms 4272 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 3 ms 4368 KB Output is correct
5 Correct 3 ms 4188 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4188 KB Output is correct
2 Correct 3 ms 4272 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 3 ms 4368 KB Output is correct
5 Correct 3 ms 4188 KB Output is correct
6 Correct 3 ms 4188 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 3 ms 4188 KB Output is correct
9 Correct 3 ms 4124 KB Output is correct
10 Correct 3 ms 4188 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4188 KB Output is correct
2 Correct 3 ms 4272 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 3 ms 4368 KB Output is correct
5 Correct 3 ms 4188 KB Output is correct
6 Correct 3 ms 4188 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 3 ms 4188 KB Output is correct
9 Correct 3 ms 4124 KB Output is correct
10 Correct 3 ms 4188 KB Output is correct
11 Correct 3 ms 4188 KB Output is correct
12 Correct 3 ms 4188 KB Output is correct
13 Correct 3 ms 4188 KB Output is correct
14 Correct 3 ms 4188 KB Output is correct
15 Correct 4 ms 4188 KB Output is correct