oj.uz

Submission #894401

# Submission time Handle Problem Language Result Execution time Memory
894401 2023-12-28T08:51:16 Z vjudge1 Rack (eJOI19_rack) C++17
100 / 100
 11 ms 2328 KB 
#include <bits/stdc++.h>
using namespace std;

#define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define rall(x) x.rbegin(), x.rend()
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define nl '\n'
#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;

const int N = 1e6 + 5;
const int M = 1e3 + 5;
const int inf = 1e9 + 123;
const ll infl = 1e15 + 10;
const int mod = 1e9 + 7;
const int P = 31;

ll n, k;
vector <pair <string, int> > ans;

void go(int v, int tl, int tr, string s){
    if(tl == tr){
        reverse(all(s));
        ans.pb(mp(s, tl));
        return;
    }
    int tm = (tl + tr) >> 1;
    go(v + v, tl, tm, s + '0');
    go(v + v + 1, tm + 1, tr, s + '1');
}

ll mul(ll a, ll b){
    return 1LL * a * b % mod;
}

ll get(string s){
    ll ans = 0;
    for(int i = sz(s) - 1; i >= 0; i--){
        ans = mul(ans, 2);
        ans += s[i] - '0';
        ans %= mod;
    }
    return ++ans;
}

string conv(ll t){
    string ret = "";
    while(t){
        ret += char('0' + t % 2);
        t >>= 1;
    }
    reverse(all(ret));
    return ret;
}

void solve() {
    cin >> n >> k;
    --k;
    string t = conv(k);
    reverse(all(t));
    while(sz(t) < n)
        t.pb('0');
    reverse(all(t));
    cout << get(t) << nl;
}

signed main() {
    speed;
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
}

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 1 ms 344 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
60.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 1 ms 344 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 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 11 ms 2328 KB Output is correct