제출 #369198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
369198		iliccmarko	Rack (eJOI19_rack)	C++14	0 / 100	9 ms	8172 KiB

rack

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL
const int N = 1e6 + 60;
ll n, k;
ll a[N];


int main()
{
    a[0] = 1LL;
    for(int i = 1;i<N;i++) a[i] = (a[i-1]*2LL)%mod;
    ios
    cin>>n>>k;
    ll stepen = 2;
    int ind = n-1;
    ll l = 1LL;
    int par = 0;
    while(true)
    {
        ll aa = k%(stepen/2);
        ll b = aa + stepen/2;
        if(par==0)
        {
            if(k%stepen==aa)
         {
            l = (l+a[ind])%mod;
        }

    }
        else if(k%stepen==b)
        {
            l = (l+a[ind])%mod;
        }
        par^=1;
        ind--;
        if(stepen>=k) break;
        stepen*=2LL;
    }

    cout<<l;





    return 0;
}

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