#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
const int MAX_N = 1e3;
void construct_k(ll k, int m, vector<int>& v){
if(k == 0LL || k== 1LL){
return;
}
else{
if(k%2LL == 0LL){
v.push_back(m++);
construct_k(k/2LL, m, v);
}
else{
construct_k(k-1LL, m+1, v);
v.push_back(m);
}
}
}
std::vector<int> construct_permutation(long long k)
{
vector<int> res;
construct_k(k, 0, res);
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 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 |
600 KB |
Output is correct |
5 |
Partially correct |
1 ms |
348 KB |
Partially correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Partially correct |
1 ms |
348 KB |
Partially correct |
9 |
Correct |
1 ms |
348 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 |
1 ms |
348 KB |
Partially correct |