제출 #594729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594729		Ozy	순열 (APIO22_perm)	C++17	91.33 / 100	2 ms	340 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define pb push_back
#define pf push_front

lli cont;
deque<lli> perm;

void arma(lli num) {
    lli mitad = num/2;

    if (mitad == 0) return;

    arma(mitad);
    perm.pb(cont++);
    if (num&1) perm.pf(cont++);
}

std::vector<int> construct_permutation(long long k)
{

    cont = 0;
    arma(k);

    lli act;
    vector<int> res;
    res.resize(cont);
    cont = 0;
    while (!perm.empty()) {
        act = perm.front();
        perm.pop_front();
        res[cont++] = act;
    }
    return res;
}

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