제출 #739115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739115		PixelCat	Permutation (APIO22_perm)	C++17	91.33 / 100	28 ms	360 KiB

perm

#include "perm.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

std::vector<int32_t> construct_permutation(long long k) {
    vector<int32_t> a, b;
    int cur = 0, p = 0;
    while(k > (1ll << p)) {
        if(k & (1ll << p)) {
            b.eb(cur); cur++;
            k -= (1ll << p);
        }
        p++;
        if(k) {
            a.eb(cur); cur++;
        }
    }
    reverse(all(b));
    a.insert(a.end(), all(b));
    for(auto &i:a) cerr << i << " ";
    cerr << "\n";
    return a;
}

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