| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 708480 | Essa2006 | Permutation (APIO22_perm) | C++17 | 5 ms | 380 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<bits/stdc++.h>
#include "perm.h"
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define aint(a) a.begin(), a.end()
#define mod (int)(1000000007)
ll pw(ll a, ll b){
ll res=1;
while(b){
if(b&1)
res*=a;
a*=a, b/=2;
}
return res;
}
int gr(ll n){
ll pr=64;
ll l=0, r=64;
while(l<=r){
ll md=(l+r)/2;
if(pw(2, md)>n){
pr=md, r=md-1;
}
else
l=md+1;
}
return pr-1;
}
vector<int> construct_permutation(ll k){
ll j=k;
k--;
vector<int>Base, Ans;
map<int, stack<int>>mp;
int las=0, cur=0;
Base.push_back(-1);
while(k>0){
int mx=min(gr(k), las);
k-=pw(2, mx);
if(mx==las)
Base.push_back(cur++), las++;
else
mp[Base[mx]].push(cur++);
}
for(int i=0;i<Base.size();i++){
if(i)
Ans.push_back(Base[i]);
while(!mp[Base[i]].empty()){
Ans.push_back(mp[Base[i]].top());
mp[Base[i]].pop();
}
}
return Ans;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
