Submission #737657

#TimeUsernameProblemLanguageResultExecution timeMemory
737657tegidPermutation (APIO22_perm)C++17
0 / 100
0 ms212 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 {1}; if(k==3)return {2, 1}; if(k==4)return {1, 2}; return {}; // should not happen }else{ if(k%2==0){ vector<int> v=construct_permutation(k/2); vector<int> ans; ans.pb(1); 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(1); return v; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...