| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1349559 | jump | Permutation (APIO22_perm) | C++20 | 0 ms | 344 KiB |
#include "perm.h"
std::vector<int> construct_permutation(long long k)
{
if(k==1)return {};
if(k==2)return {0};
std::vector<int> ans;
int m = k%2;
if(m==0||m==2)ans=construct_permutation(k/2),ans.push_back(ans.size());
if(m==1)ans=construct_permutation(k-1),ans.insert(ans.begin(),ans.size());
return ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
