oj.uz

Submission #582684

# Submission time Handle Problem Language Result Execution time Memory
582684 2022-06-24T09:11:02 Z Vanilla Permutation (APIO22_perm) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
vector<int>
construct_permutation(ll k)
{
    --k;
    int m = 1;
 
    while(k+1 > (1ll<<(m))) {
        ++m;
    }
 
    vector<int> perm(m);
 
    for (int i = 0; i < m; ++i) {
        perm[i] = i;
    }
 
    for (int i = m-2; i >= 0; --i) {
        if ((k & (1ll << i)) == 0)
            swap(perm[i],perm[i+1]);
    }
 
    return perm;
}

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -