oj.uz

Submission #912480

# Submission time Handle Problem Language Result Execution time Memory
912480 2024-01-19T14:20:19 Z stegatxins0 Permutation (APIO22_perm) C++17
100 / 100
 2 ms 600 KB 
#include <bits/stdc++.h>
#include "perm.h"
using namespace std;

using ll = long long;

std::vector<int> construct_permutation(long long k) {
    int n = __lg(k);
    int ma1,ma2,cur=2;
    vector<int> ans(n);
    iota(ans.begin(),ans.end(),0);
    for(int i=n-1; i>=0;i--){
        if((k>>i)&1){
            if(cur){
                if(cur == 2){
                    ma2 = i+1;
                    ans.insert(ans.begin()+i, n);
                }
                if(cur == 1){
                    ma1 = i;
                    ans.insert(ans.begin()+i, n+1);
                }
                cur--;
            }
            else if(i-1>=0 && (k>>(i-1))&1 ){
                ans[ma1]++; ans[ma2]++;
                ans.insert(ans.begin()+i-1, ans[ma2]-1);
                ma1++; ma2++;
                i--;
            }else{
                ans.insert(ans.begin()+i, ans[ma1]+1);
                ma2 = ma1+1;
                ma1 = i;
            }
        }
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct