Submission #464887

# Submission time Handle Problem Language Result Execution time Memory
464887 2021-08-14T11:30:32 Z ewirlan Rack (eJOI19_rack) C++11
40 / 100
0 ms 204 KB
//RACK

#define _CTR_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
typedef long long ll;
constexpr ll mod = 1e9 + 7;
#include <random>
int main()
{
    std::mt19937_64 twist;
    std::cin.tie(nullptr); std::cout.tie(nullptr); std::ios_base::sync_with_stdio(0);
    ll n, K;
    std::cin >> n >> K;
    int ind(1);
    while (ind--)
    {
        ll p(0), k((1ll << std::min(61ll, n)) - 1), s, odp(0), pot(1);
            while (k > p)
            {
                s = (p + k + 1) / 2;
                if (K <= s)k = s - 1;
                else
                {
                    p = s;
                    odp = (odp + pot) % mod;
                }
                pot = (pot * 2) % mod;
            }
            std::cout << (odp+1)%mod << '\n';
            if (ind) {
                K = twist() % ll(1e18) + 1;
                n = twist() % ll(1e6) + 100;
                std::cerr << n <<' '<<K << ' ';
            }
    }
    
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Incorrect 0 ms 204 KB Output isn't correct
13 Halted 0 ms 0 KB -