oj.uz

Submission #1104015

# Submission time Handle Problem Language Result Execution time Memory
1104015 2024-10-22T14:57:44 Z vjudge1 Rack (eJOI19_rack) C++17
40 / 100
 1 ms 336 KB 
#include <algorithm>
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <vector>

#define int long long

using namespace std;
const long long mod = 1e9+7;

int binary_exponentiation(int number, int exponent)
{
    int result = 1;
    while (exponent > 0) {

        if(exponent & 1) result = result * number;

        number = number * number;
        exponent >>= 1;
        number%=mod;
        exponent%=mod;
    }

    return result;
}


int make_path(long long seed, int length) 
{
    long long path = 0;
    for (int i = 0; i < min(length, 62LL); i++) {
        if (((seed >> i) & 1) == 1) path = (path + binary_exponentiation(2, length - i - 1))%mod;
    }
    return path;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    long long height, node;
    cin >> height >> node;
    cout << (make_path(node - 1, height) + 1)%mod << endl;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 60.0

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