#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> bits;
void add(ll k)
{
if(k == 0)
{
return;
}
for(ll i = 59 ; i >= 1 ; i--)
{
if(k - ((1ll<<i) - 1) >= 0)
{
bits.push_back(i);
k-=((1ll<<i) - 1);
add(k);
break;
}
}
}
std::vector<int> construct_permutation(long long k)
{
k--;
bits.clear();
int n = 0;
add(k);
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Partially correct |
1 ms |
344 KB |
Partially correct |
4 |
Partially correct |
1 ms |
512 KB |
Partially correct |
5 |
Partially correct |
3 ms |
604 KB |
Partially correct |
6 |
Partially correct |
4 ms |
604 KB |
Partially correct |
7 |
Partially correct |
5 ms |
860 KB |
Partially correct |
8 |
Partially correct |
6 ms |
1116 KB |
Partially correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Partially correct |
8 ms |
1368 KB |
Partially correct |
11 |
Partially correct |
6 ms |
1152 KB |
Partially correct |
12 |
Partially correct |
5 ms |
860 KB |
Partially correct |
13 |
Partially correct |
6 ms |
1116 KB |
Partially correct |