제출 #1012727

#제출 시각아이디문제언어결과실행 시간메모리
1012727codefox순열 (APIO22_perm)C++17
0 / 100
0 ms600 KiB
#include<bits/stdc++.h> #include "perm.h" using namespace std; std::vector<int> construct_permutation(long long k) { int l = log2(k); cout << l << endl; vector<int> sol(l); iota(sol.begin(), sol.end(), 0); for (int i = l-1; i >= 0; i--) { if (k&(1LL<<i)) { sol.push_back(0); for (int j = sol.size()-1; j >i; j--) { sol[j] = sol[j-1]; } sol[i] = l++; } } return sol; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...