Submission #1012731

# Submission time Handle Problem Language Result Execution time Memory
1012731 2024-07-02T14:27:34 Z codefox Permutation (APIO22_perm) C++17
91.3333 / 100
1 ms 508 KB
#include<bits/stdc++.h>
#include "perm.h"

using namespace std;

std::vector<int> construct_permutation(long long k)
{
    int l = 0;
    for (int i = 62; i>= 0; i--)
    {
        if (k&(1LL<<i)) l =max(l,i);
    }
    vector<int> sol(l);
    iota(sol.begin(), sol.end(), 0);

    for (int i = l-1; i >= 0; i--)
    {
        if (k&(1LL<<i))
        {
            sol.push_back(0);
            for (int j = sol.size()-1; j >i; j--)
            {
                sol[j] = sol[j-1];
            }
            sol[i] = l++;
        }
    }
    return sol;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 1 ms 344 KB Partially correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Partially correct 1 ms 436 KB Partially correct
9 Correct 1 ms 348 KB Output is correct
10 Partially correct 1 ms 508 KB Partially correct
11 Partially correct 1 ms 348 KB Partially correct
12 Partially correct 1 ms 348 KB Partially correct
13 Partially correct 1 ms 348 KB Partially correct