Submission #973442

#	Time	Username	Problem	Language	Result	Execution time	Memory
973442		CDuong	Permutation (APIO22_perm)	C++17	91.33 / 100	2 ms	656 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> construct_permutation(long long k)
{
	vector<int> binary;
	while (k) {
		binary.push_back(k & 1);
		k >>= 1;
	}
	reverse(binary.begin(), binary.end());

	deque<int> dq;
	int cnt = 0, sz = (int)binary.size(), cntt = 0;
	for (int i = 1; i < sz; ++i) {
		dq.emplace_back(cnt++);
		if (binary[i]) {
			if (i + 1 < sz and binary[i + 1] and cntt > 1) {
				int val = dq.front(); dq.pop_front();
				dq.emplace_front(cnt + 1);
				dq.emplace_front(val);
				dq.emplace_front(cnt);
				cnt += 2;
			}
			else dq.emplace_front(cnt++);
		}
	}
	return {dq.begin(), dq.end()};
}

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