Submission #638468

#	Time	Username	Problem	Language	Result	Execution time	Memory
638468		ShirleyM	Rack (eJOI19_rack)	C++14	100 / 100	10 ms	7892 KiB

rack

#include <bits/stdc++.h>
using namespace std;
#define int int64_t
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
#define x first
#define y second
#define pb push_back
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(a) a.begin(),a.end()
#define fast {ios_base::sync_with_stdio(false); cin.tie(0);}
const int inf = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;


int32_t main() {
    fast;
    int n; int k; cin >> n >> k;
    vi mul_mod(n+1, 1), mul(65, 1);
    loop(i,1,n+1) mul_mod[i] = (mul_mod[i-1] * 2) % mod;
    loop(i,1,65) mul[i] = mul[i-1] * 2;
    int ind = k; ind--;
    int ans = 1;
    while(ind!=0){
        int i = log2(ind);
        (ans += mul_mod[n-i-1]) %= mod;
        ind -= mul[i];
    }
    cout << ans;
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 60 / 60