| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 601905 | patrikpavic2 | 순열 (APIO22_perm) | C++17 | 3 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 "perm.h"
#include <vector>
#include <algorithm>
#define PB push_back
using namespace std;
typedef vector < int > vi;
typedef long long ll;
vi construct_permutation(long long k){
k--;
if(k == 0) return {};
if(k == 1) return {0};
if(k == 2) return {1, 0};
vi st = construct_permutation((k - 1) / 2 + 1);
st.PB((int)st.size());
if(!(k & 1)){
for(int& x : st) x++;
st.PB(0);
}
return st;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
