# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985555 | ParsaGolestani | Permutation (APIO22_perm) | C++17 | 3 ms | 500 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2'000'0000;
vector<int> makeOk(deque<int> dq) {
vector<int> vec1, vec2;
for (int i = 0; i < dq.size(); i++)
vec1.push_back(dq[i]);
sort(vec1.begin(), vec1.end());
for (int i = 0; i < dq.size(); i++)
vec2.push_back(lower_bound(vec1.begin(), vec1.end(), dq[i]) - vec1.begin());
return vec2;
}
vector<int> construct_permutation(ll k) {
deque<int> dq;
int bit = 63 - __builtin_clzll(k);
if ((k & (1ll << (bit - 1)))) {
dq.push_back(1);
dq.push_back(0);
}
else
dq.push_back(0);
int pnt = 0;
for (int j = bit - 2; j >= 0; j--) {
dq.push_front(--pnt);
if ((k & (1ll << j)))
dq.push_back(--pnt);
}
return makeOk(dq);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |