#include "perm.h"
#include <bits/stdc++.h>
//#include <vector>
#define pb push_back
#define ll long long
using namespace std;
vector<int> construct_permutation(long long k){
int l = 0;
for (int i = 60; i >= 0; i--)
if (((1LL<<i)&k)) {l = i; break;}
vector <int> v; v.clear();
for (int i=0;i<l;i++) v.pb(i);
ll val = l - 1;
for (int i = l-1; i >= 0; i--)
if (((1LL<<i)&k))
v.insert(v.begin() + i, ++val);
return v;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Partially correct |
1 ms |
340 KB |
Partially correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Partially correct |
2 ms |
340 KB |
Partially correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Partially correct |
2 ms |
340 KB |
Partially correct |
11 |
Partially correct |
1 ms |
340 KB |
Partially correct |
12 |
Partially correct |
1 ms |
340 KB |
Partially correct |
13 |
Partially correct |
2 ms |
340 KB |
Partially correct |