#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int>construct_permutation(ll k){
vector<int>ans;
for(int i = 63 - __builtin_clzll(k) - 1, current = 0, front_cnt = 0; i > -1; i--){
ans.emplace_back(current++);
if((1LL << i) & k){
if(i > 0 && front_cnt > 1 && ((1LL << (i - 1)) & k)){
ans.emplace_back(current++);
ans.insert(ans.begin() + 2, current++);
i--;
}
else{
ans.insert(ans.begin(), current++);
front_cnt++;
}
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
600 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
2 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |