Submission #1306795

#TimeUsernameProblemLanguageResultExecution timeMemory
1306795yus1f_mRack (eJOI19_rack)C++20
0 / 100
147 ms131860 KiB
#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=25,INF=1000000000; using namespace std; vector<ll>pow2; vector<vector<ll>>res(sz); void solve() { ll n,m,num; cin>>n>>m; vector<ll>ans; for(int i=0;i<res[n+1].size();i++) { ans.pb(res[n+1][i]); } cout<<ans[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); } res[1].pb(1); for(int i=2;i<sz;i++) { for(int j=0;j<res[i-1].size();j++) { res[i].pb(res[i-1][j]),res[i].pb(res[i-1][j]+pow2[i-2]); } } ll t=1; //cin>>t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...