Submission #725181

#TimeUsernameProblemLanguageResultExecution timeMemory
725181SanguineChameleonPermutation (APIO22_perm)C++17
94.33 / 100
3 ms372 KiB
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> construct_permutation(long long k) {
	if (k == 1) {
		return {};
	}
	vector<int> nums = {2, 3, 4, 5, 6, 7, 8, 9, 10};
	for (auto p: nums) {
		if (k % p == 0) {
			vector<int> res = construct_permutation(k / p);
			int n = res.size();
			for (int i = p - 2; i >= 0; i--) {
				res.push_back(n + i);
			}
			return res;
		}
	}
	vector<int> res = construct_permutation(k / 2);
	int n = res.size();
	res.push_back(n);
	if (k % 2 == 1) {
		for (auto &x: res) {
			x++;
		}
		res.push_back(0);
	}
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...