#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> construct_permutation(long long k)
{
vector<int> a;
vector<int> ret;
while(k>0)
{
if(k%2==1)a.push_back(1);
else a.push_back(0);
k/=2;
}
int n=a.size();
int idx=0;
for(idx=0;idx<n-1;idx++)ret.push_back(idx);
for(int i=n-2;i>=0;i--)
{
if(a[i]==0)continue;
ret.insert(ret.begin()+i,idx++);
}
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Partially correct |
1 ms |
348 KB |
Partially correct |
6 |
Correct |
2 ms |
356 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Partially correct |
1 ms |
348 KB |
Partially correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Partially correct |
1 ms |
344 KB |
Partially correct |
11 |
Partially correct |
1 ms |
348 KB |
Partially correct |
12 |
Partially correct |
1 ms |
348 KB |
Partially correct |
13 |
Partially correct |
2 ms |
348 KB |
Partially correct |