Submission #601279

#	Time	Username	Problem	Language	Result	Execution time	Memory
601279		doowey	Permutation (APIO22_perm)	C++17	91.33 / 100	3 ms	376 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair


vector<int> construct_permutation(ll k)
{

	if(k == 1) return {};
    if(k % 2 == 1){
        vector<int> sol = construct_permutation(k - 1);
        vector<int> res;
        res.push_back(sol.size());
        for(auto x : sol) res.push_back(x);
        return res;
    }
    else{
        vector<int> sol = construct_permutation(k / 2ll);
        sol.push_back(sol.size());
        return sol;
    }
}

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