# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642543 | danikoynov | Permutation (APIO22_perm) | C++17 | 2 ms | 340 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;
vector < int > construct_permutation(ll k)
{
vector < int > v;
k --;
ll cur = 0, cnt = 0;
bool tf = false;
for (ll bit = 63; bit >= 0; bit --)
{
if ((k & ((ll)1 << bit)) != 0)
{
if (!tf)
{
for (int s = 0; s < bit; s ++)
v.push_back(cur ++);
cnt ++;
tf = true;
}
else
{
if (bit == 0)
{
cnt ++;
continue;
}
cur ++;
int num = v[bit - 1];
num ++;
for (int j = bit; j < v.size(); j ++)
v[j] ++;
v.push_back(num);
}
}
}
vector < int > d;
for (int s = 0; s < cnt; s ++)
d.push_back(cur ++);
reverse(d.begin(), d.end());
for (int j = 0; j < v.size(); j ++)
d.push_back(v[j]);
v = d;
/**for (int i = 0; i < v.size(); i ++)
cout << v[i] << " ";
cout << endl;*/
return v;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |