Submission #984751

#	Time	Username	Problem	Language	Result	Execution time	Memory
984751		Uultan12	Permutation (APIO22_perm)	C++17	0 / 100	1 ms	344 KiB

perm

#include <vector>
#include <algorithm>

std::vector<int> construct_permutation(long long k) {
    int n = 1;
    while ((n * (n + 1)) / 2 < k) {
        ++n;
    }

    std::vector<int> permutation(n);
    for (int i = 0; i < k; ++i) {
        permutation[i] = i;
    }

    // Fill the remaining elements with values not used in the increasing subsequence
    int next_value = k;
    for (int i = k; i < n; ++i) {
        permutation[i] = next_value++;
    }

    return permutation;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 90