Submission #739285

#TimeUsernameProblemLanguageResultExecution timeMemory
739285CyberCrazePermutation (APIO22_perm)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i<b;i++)
using namespace std;

vector<int> construct_permutation(ll k){
    //consecutive list of length n=2^n sets
    int lbit=__lg(k);
    ll ix=0;
    vector<int> ans;FOR(i,0,lbit+1){ans.push_back(ix);ix++;};
    while(lbit!=0){
        k-=pow(2,lbit);
        lbit=__lg(k);
        FOR(i,0,lbit+1){ans.insert(ans.begin()+i,ix);ix++;};
    };
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...