Submission #1306789

#	Time	Username	Problem	Language	Result	Execution time	Memory
1306789		yus1f_m	Rack (eJOI19_rack)	C++20	0 / 100	1 ms	572 KiB

rack

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000;
using namespace std;
vector<ll>pow2;
void solve()
{
    ll n,m,num;
    cin>>n>>m;
    vector<ll>nums;
    num=pow2[n];
    for(int i=1;i<=num/2;i+=2)
    {
        nums.pb(i),nums.pb(i+num/2);
    }
    for(int i=2;i<=num/2;i+=2)
    {
        nums.pb(i),nums.pb(i+num/2);
    }
    cout<<nums[m-1];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    for(int i=1;i<INF;i*=2)
    {
        pow2.pb(i);
    }
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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