| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 621670 | MinaRagy06 | Permutation (APIO22_perm) | C++17 | 4 ms | 368 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>
#include "perm.h"
// #include "grader.cpp"
using namespace std;
#define lesgooo ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
vector<int> add(vector<int>&a, int ii, int num)
{
vector<int> ret(a.size()+1);
int ptr = 0;
for (int i = 0; i < ret.size(); i++)
{
if (i == ii) ret[i] = num;
else ret[i] = a[ptr], ptr++;
}
return ret;
}
vector<int> construct_permutation(long long k)
{
int ans = 0;
for (int i = 0; i <= 63; i++) if (!(k>>i)) {ans = i-1; break;}
k-=((1ll<<ans));
vector<int> a(ans);
for (int i = 0; i < ans; i++) a[i]=i;
int toAdd = ans;
while (k)
{
ans = 0;
for (int i = 0; i <= 63; i++) if (!(k>>i)) {ans = i-1; break;}
k-=(1ll<<ans);
a = add(a, ans, toAdd), toAdd++;
}
return a;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
