제출 #981563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981563		c2zi6	순열 (APIO22_perm)	C++17	64.63 / 100	13 ms	1116 KiB

perm

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "perm.h"

VI construct_permutation(ll k) {
	int n = 0;
	VI seg;
	reprl(i, 62, 0) if (k & (1ll<<i)) {
		seg.pb(i);
		n += i;
	}
	n += seg.size()-1;

	VI ret(n);
	rep(i, n) ret[i] = n-i-1;

	int l = 0;
	for (int x : seg) {
		int r = l + x;
		reverse(ret.begin() + l, ret.begin() + r);
		l = r;
	}

	return ret;
}

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