Submission #737659

#TimeUsernameProblemLanguageResultExecution timeMemory
737659tegidPermutation (APIO22_perm)C++17
91.33 / 100
3 ms340 KiB
#include "perm.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb emplace_back vector<int> construct_permutation(ll k){ if(k<=4){ if(k==2)return {0}; if(k==3)return {1, 0}; if(k==4)return {0, 1}; return {}; // should not happen }else{ if(k%2==0){ vector<int> v=construct_permutation(k/2); vector<int> ans; ans.pb(0); for(int i=0;i<(int)v.size();i++)ans.pb(v[i]+1); return ans; }else{ vector<int> v=construct_permutation(k-1); for(int i=0;i<(int)v.size();i++)v[i]++; v.pb(0); return v; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...