#include <iostream>
#include <vector>
using namespace std;
vector<int> construct_permutation(long long k){
vector<int> a;
while((1ll<<a.size()) <= k) a.push_back(a.size());
a.pop_back();
k -= 1<<a.size();
if(k > 0){
int bt = 60;
while(!((k >> bt)&1)) --bt;
for(int &x:a) if(x >= bt) ++ x;
a.push_back(bt);
k -= 1LL<<bt --;
while(bt >= 0){
if(bt > 0 && (k>>(bt-1)) == 3){
--bt;
for(int &x:a) if(x >= bt) ++ x;
a.insert(a.end() - 2, bt);
k -= 3LL<<bt--;
}
else if((k >> bt) == 1){
for(int &x:a) if(x >= bt) ++x;
a.push_back(bt);
k -= 1LL<<bt--;
}
else bt --;
}
}
return a;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |