# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1202435 | dzuizz | Permutation (APIO22_perm) | C++20 | 8 ms | 1604 KiB |
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> construct_permutation(long long k){
vector<int> p;
int n=0;
for(int i=1;i<60;++i) if(k>>i&1){
for(int j=n+i-1;j>=n;--j)
p.emplace_back(j);
n+=i;
}
for(int i=1;i<__builtin_popcountll(k);++i)
p.emplace_back(n+i-1);
reverse(p.begin(),p.end());
return p;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |