Submission #638471

#	Time	Username	Problem	Language	Result	Execution time	Memory
638471		TranGiaHuy1508	Permutation (APIO22_perm)	C++17	86.63 / 100	4 ms	468 KiB

perm

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

using ll = long long;

namespace {
	vector<int> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};

	deque<int> q;
	int lim;

	void mult(int x){
		for (int i = lim + x - 2; i >= lim; i--){
			q.push_back(i);
		}
		lim += x - 1;
	}

	void add1(){
		q.push_front(lim++);
	}

	void solve(ll k){
		if (k == 1) return;
		for (int i = (int)primes.size() - 1; i >= 0; i--){
			if (k % primes[i] == 0){
				solve(k / primes[i]);
				mult(primes[i]);
				return;
			}
		}
		solve(k - 1);
		add1();
		return;
	}
}

vector<int> construct_permutation(ll k){
	lim = 0;
	solve(k);
	vector<int> v;
	while (!q.empty()){
		v.push_back(q.front());
		q.pop_front();
	}
	return v;
}

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