제출 #726648

#제출 시각아이디문제언어결과실행 시간메모리
726648vjudge1순열 (APIO22_perm)C++17
71.22 / 100
14 ms1324 KiB
#include<bits/stdc++.h> using namespace std; #define all(fl) fl.begin(),fl.end() #define pb push_back #define fi first #define se second #define for1(i,j,k) for(int i=j;i<=k;i++) #define for2(i,j,k) for(int i=j;i>=k;i--) #define for3(i,j,k,l) for(int i=j;i<=k;i+=l) #define lb lower_bound #define ub upper_bound #define sz(a) (int)a.size() #define pii pair<int,int> #define pli pair<long long,int> #define gcd __gcd #define lcm(x,y) x*y/__gcd(x,y) #define lastbit(i) __builtin_ctz(i) vector<int> construct_permutation(long long k){ int num=0; vector<int>vcl; k--; while (k){ //cerr<<k<<'\n'; for2(i,60,1){ if ((1ll<<i)-1<=k){ k-=(1ll<<i)-1; vcl.pb(i); num+=i; //cerr<<i<<" "<<k<<'\n'; break; } } } vector<int>ans; for (auto v:vcl){ vector<int>hjhj; int dd=v; while (dd){ hjhj.pb(num--); dd--; } reverse(all(hjhj)); for (auto u:hjhj){ ans.pb(u-1); } } return ans; } /*signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); //freopen(".INP","r",stdin); //freopen(".OUT","w",stdout); vector<int>vl=construct_permutation(8); for (auto v:vl){ cout<<v<<" "; } }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...