제출 #1199424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1199424		sula2	Permutation (APIO22_perm)	C++20	91.33 / 100	2 ms	328 KiB

perm

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define bitcount __builtin_popcount
#define all(a) a.begin(), a.end()
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;

vector<int> construct_permutation(long long k) {
    vector<long long> path;
    while (k > 0) {
        path.push_back(k);
        k = k & 1 ? k - 1 : k / 2;
    }
    reverse(all(path));
    vector<int> seq;
    int mn = 0, mx = 1;
    for (int i = 1; i < path.size(); i++) {
        if (path[i] == path[i-1] + 1)
            seq.push_back(mn--);
        else
            seq.push_back(mx++);
    }
    mn++;
    for (int& x : seq) x -= mn;
    return seq;
}

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