# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
675984 | Essa2006 | Permutation (APIO22_perm) | C++17 | 1 ms | 212 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>
using namespace std;
#define int long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
int mx=0, K;
vector<int>AAns;
void solve(){
vector<int>Ans;
bitset<1000>a=K;
int group=0;
for(int i=0;i<=64;i++){
if(a[i]){
group++;
for(int j=0;j<i;j++)
Ans.push_back(j);
}
}
vector<int>Old=Ans;
int n=Ans.size(), cur=0;
for(int i=n-1;i>=0;i--){
if(!Old[i]){
int ind=i;
while(true){
Ans[ind]=cur++;
if(ind<n-1 && Old[ind+1])
ind++;
else
break;
}
}
}
group--;
for(int i=0;i<Ans.size();i++)
Ans[i]+=mx;
mx+=cur;
for(int i=0;i<AAns.size();i++){
Ans.push_back(AAns[i]);
}
AAns=Ans;
if(group>1){
K=group+1;
solve();
}
else if(group){
int s=mx;
for(int i=0;i<AAns.size();i++){
swap(AAns[i], s);
}
AAns.push_back(s);
}
}
vector<int> construct_permutation(int k){
K=k;
mx=0;
AAns.clear();
solve();
return AAns;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |