oj.uz

Submission #638463

# Submission time Handle Problem Language Result Execution time Memory
638463 2022-09-06T08:33:54 Z TranGiaHuy1508 Permutation (APIO22_perm) C++17
0 / 100
 1 ms 212 KB 
#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};

	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){
				mult(primes[i]);
				solve(k / primes[i]);
				return;
			}
		}
		add1();
		solve(k - 1);
		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
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -