oj.uz

Submission #976005

# Submission time Handle Problem Language Result Execution time Memory
976005 2024-05-06T04:56:02 Z Orifkhon Permutation (APIO22_perm) C++17
10 / 100
 2 ms 476 KB 
#include<bits/stdc++.h>
#include "perm.h"

using namespace std;
#ifdef LOCAL
#include "debug.cpp"
#else
#define debug(...) 
#endif
#define ll long long


vector<int> construct_permutation(long long k) {
    ll size = log2(k);

    vector<int> perm(size);
    for(int i = 0; i < size; i++){
        perm[i] = i;
    }	
    k-=(1ll << size);
    ll insert = size;
    while(k > 0){
        ll ind = log2(k);
        k-=(1ll << ind);
        perm.insert(perm.begin() + ind, insert);
        insert++;
    }
    debug(perm);
    return perm;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 2 ms 476 KB Output isn't correct
6 Halted 0 ms 0 KB -