#include <bits/stdc++.h>
#include "perm.h"
using namespace std;
vector<int> add(vector<int> a,vector<int> b)
{
for(int &i:a)
i+=b.size();
for(int i:b)
a.push_back(i);
return a;
}
vector<int> get(int p)
{
vector<int> v;
for(int i=0;i<p;i++)
{
v.push_back(i);
}
return v;
}
vector<int> construct_permutation(long long k) {
vector<int> cur;
for(int i=0;i<60;i++)
{
if(k&(1LL<<i))
cur=add(cur,get(i));
}
for(int i=0;i+1<__builtin_popcountll(k);i++)
{
cur=add({0},cur);
}
return cur;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Partially correct |
2 ms |
340 KB |
Partially correct |
4 |
Partially correct |
4 ms |
468 KB |
Partially correct |
5 |
Partially correct |
18 ms |
808 KB |
Partially correct |
6 |
Partially correct |
9 ms |
712 KB |
Partially correct |
7 |
Partially correct |
17 ms |
852 KB |
Partially correct |
8 |
Partially correct |
19 ms |
1160 KB |
Partially correct |
9 |
Correct |
2 ms |
340 KB |
Output is correct |
10 |
Partially correct |
28 ms |
1496 KB |
Partially correct |
11 |
Partially correct |
20 ms |
1236 KB |
Partially correct |
12 |
Partially correct |
14 ms |
1012 KB |
Partially correct |
13 |
Partially correct |
24 ms |
1172 KB |
Partially correct |