#include<bits/stdc++.h>
#include "perm.h"
using namespace std;
#define ff first
#define ss second
vector<int> construct_permutation(long long k){
int lst=0,sum=0;
for(long long i=0; i<60; i++){
if(k&(1ll<<i)){
lst=i;
sum++;
}
}
int x=0,z=lst;
vector<int> v;
for(long long i=0; i<lst; i++,x++){
if(k&(1ll<<i)){
v.push_back(z);
z++;
}
v.push_back(x);
}
return v;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |