#include<bits/stdc++.h>
#include "perm.h"
using namespace std;
std::vector<int> construct_permutation(long long k)
{
int l = log2(k);
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |