Submission #497536

#	Time	Username	Problem	Language	Result	Execution time	Memory
497536		Karabasan	Rack (eJOI19_rack)	C++17	100 / 100	12 ms	15696 KiB

rack

#include <bits/stdc++.h>
#define ll long long
#define fast1 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define int long long
#define mod 1000000007
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")

int n,k;
vector<int> v;
int dizi[1000006];
void solve()
{
    cin>>n>>k;
    k--;
    dizi[0]=1;
    for(int i=1;i<=1000000;i++)
        dizi[i]=(dizi[i-1]*2)%mod;
    int cvp[n+5]={};
    int p=1;
    while(k)
    {
        cvp[p]=(k%2);
        k/=2;
        p++;
    }

    int cevap=0;
    for(int i=n;i>=1;i--)
    {
        if(cvp[i])
            cevap=(cevap+dizi[n-i])%mod;
    }
    cout<<(cevap+1)%mod;
}
signed main()
{
    //fast1
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

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