| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 718416 | vjudge1 | Permutation (APIO22_perm) | C++17 | 0 ms | 0 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.
std::vector<int> construct_permutation(long long k)
{
vector <int> ans;
//return ans;
for(int i = 0;; ++i){
vector <int> tmp;
int sz = i + 1;
if (ans.empty()) ans.push_back(i);
else {
for(int p = 0; p < sz; ++p){
vector<int> cur = ans;
cur.insert(cur.begin() + p, i);
if (count_increasing(cur) <= k) tmp = cur;
else break;
}
ans = tmp;
}
if (count_increasing(ans) == k){
break;
}
}
return ans;
}
