제출 #1201680

#제출 시각아이디문제언어결과실행 시간메모리
1201680adiyerPermutation (APIO22_perm)C++20
71.22 / 100
7 ms1092 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector < int > construct_permutation(ll k){
    k--;
    int x = 0, y = 0;
    vector < int > ans[60];
    for(ll bit = 59; bit >= 1; bit--){
        while(k >= (1ll << bit) - 1){
            k -= (1ll << bit) - 1, x++;
            for(int i = 0; i < bit; i++) ans[x].push_back(y++);
        }
    }
    for(int i = x; i >= 1; i--){
        for(int val : ans[i]){
            ans[0].push_back(val);
        }
    }
    return ans[0];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...