제출 #739293

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739293		CyberCraze	Permutation (APIO22_perm)	C++17	10 / 100	6 ms	596 KiB

perm

#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){ans.push_back(ix);ix++;};
    k-=pow(2,lbit);
    //2^n, the rest is 2^n-1
    while(lbit!=0){
        lbit=__lg(k+1);
        k-=(pow(2,lbit)-1);
        FOR(i,0,lbit){ans.insert(ans.begin()+i,ix);ix++;};
    };
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 90