#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
std::vector<int> construct_permutation(long long k)
{
for(ll l = 1 ;l < 60 ;l++)
{
ll x = k + l - 1;
if(__builtin_popcountll(x) <= l)
{
int n = 0;
vector<int> bits;
for(ll i = 0 ; i < 60 ; i++)
{
if((1ll<<i) & x)
{
bits.push_back(i);
}
}
while ((int)bits.size() < l)
{
for(int i = 0 ; (int)bits.size()< l && i < (int)bits.size() ; i++)
{
int bit = bits[i];
if(bit > 1)
{
bits[i] = --bit;
bits.push_back(bits[i]);
}
}
}
for(auto bit : bits)
n+=bit;
n--;
vector<int> perm;
for(auto i : bits)
{
for(int j = n - i + 1 ; j <= n ; j++)
{
perm.push_back(j);
}
n-=i;
}
return perm;
}
}
return {-1};
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Partially correct |
1 ms |
348 KB |
Partially correct |
4 |
Partially correct |
1 ms |
360 KB |
Partially correct |
5 |
Partially correct |
3 ms |
604 KB |
Partially correct |
6 |
Partially correct |
3 ms |
604 KB |
Partially correct |
7 |
Partially correct |
5 ms |
860 KB |
Partially correct |
8 |
Partially correct |
7 ms |
1116 KB |
Partially correct |
9 |
Partially correct |
1 ms |
348 KB |
Partially correct |
10 |
Partially correct |
8 ms |
1372 KB |
Partially correct |
11 |
Partially correct |
6 ms |
1032 KB |
Partially correct |
12 |
Partially correct |
5 ms |
860 KB |
Partially correct |
13 |
Partially correct |
6 ms |
1116 KB |
Partially correct |