oj.uz

Submission #975983

# Submission time Handle Problem Language Result Execution time Memory
975983 2024-05-06T04:16:56 Z Orifkhon Permutation (APIO22_perm) C++17
10 / 100
 1000 ms 1344 KB 
#include <bits/stdc++.h>
#include <perm.h>
using namespace std;
 
vector<int> construct_permutation(long long k) {
    long long size = log2(k);
    vector<int> perm(size);
    for(int i = 0; i < size; i++){
        perm[i] = i;
    }
    k-=(1 << size);
    long long insert = size;
    while(true){
        if(k == 0){
            break;
        }
        long long ind = log2(k);
        k-=(1 << ind);
        perm.insert(perm.begin() + ind, insert);
        insert++;
    }
    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 1 ms 600 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 1 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Execution timed out 1075 ms 1344 KB Time limit exceeded
6 Halted 0 ms 0 KB -