Submission #638488

#	Time	Username	Problem	Language	Result	Execution time	Memory
638488		TranGiaHuy1508	Permutation (APIO22_perm)	C++17	10 / 100	1 ms	340 KiB

perm

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

using ll = long long;

namespace {
	vector<int> primes = {2, 3, 5};

	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 revert_mult(int x){
		for (int i = 0; i < x - 1; i++) q.pop_back();
		lim -= x - 1;
	}

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

	void sub1(){
		q.pop_front();
		lim--;
	}

	bool solve(ll k){
		if (k == 1) return true;
		for (int i = 0; i < (int)primes.size(); i++){
			if (k % primes[i] == 0){
				bool success = solve(k / primes[i]);
				if (!success) return false;
				mult(primes[i]);
				if (lim >= 90){
					revert_mult(primes[i]);
					return false;
				}
				return true;
			}
		}
		bool success = solve(k - 1);
		if (!success) return false;
		add1();
		if (lim >= 90){
			sub1();
			return false;
		}

		return true;
	}
}

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: 0 / 90