제출 #708140

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

perm

#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi first
#define se second
const int INF = 1e9+1;
const int P = 1000000007;
const ll LLINF = (ll)1e18+1;
template <typename T>
istream& operator>>(istream& is, vector<T>& v) { for(auto &i : v) is >> i; return is; }
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << p.fi << " " << p.se; return os; }
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) { for(auto i : v) os << i << " "; os << "\n"; return os; }

vector<int> construct_permutation(ll k) {
	vector<int> chk;
	for(int i = 0; k; i++, k >>= 1)
		if(k&1) chk.push_back(i);
	vector<int> ret;
	for(int i = 0; i < chk.back(); i++) ret.push_back(i*2+1);
	chk.pop_back();
	reverse(chk.begin(), chk.end());
	for(auto i : chk) ret.push_back(i*2);
	vector<int> srt(ret);
	sort(srt.begin(), srt.end());
	for(auto &i : ret) i = lower_bound(srt.begin(), srt.end(), i) - srt.begin();
	return ret;
}

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