Submission #731032

#TimeUsernameProblemLanguageResultExecution timeMemory
731032aykhnRack (eJOI19_rack)C++14
20 / 100
1 ms452 KiB
#include <bits/stdc++.h> /* author: aykhn 4/24/2023 */ using namespace std; typedef long long ll; #define OPT ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) #define pii pair<int,int> #define pll pair<ll,ll> #define all(v) v.begin(), v.end() #define mpr make_pair #define pb push_back #define ts to_string #define fi first #define se second #define inf 0x3F3F3F3F #define infll 0x3F3F3F3F3F3F3F3FLL #define bpc __builtin_popcount #define print(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout<<endl; const ll mod = 1000000007; vector<int> v(1025, 0); int n, k, val; int ans; void f(int i, int from) { if (val == k) ans = i; v[i] = val++; int pow = (1 << n); while (pow > from) { f(i + pow, pow); pow >>= 1; } } int main() { OPT; cin >> n >> k; n--; val = 1; f(1, 0); cout << v[k] << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...