#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
vector<int> construct_permutation(ll k)
{
if(k == 1) return {};
if(k % 2 == 1){
vector<int> sol = construct_permutation(k - 1);
vector<int> res;
res.push_back(sol.size());
for(auto x : sol) res.push_back(x);
return res;
}
else{
vector<int> sol = construct_permutation(k / 2ll);
sol.push_back(sol.size());
return sol;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Partially correct |
2 ms |
340 KB |
Partially correct |
6 |
Correct |
2 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
296 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 |
3 ms |
340 KB |
Partially correct |
12 |
Partially correct |
2 ms |
376 KB |
Partially correct |
13 |
Partially correct |
2 ms |
340 KB |
Partially correct |