oj.uz

Submission #638481

# Submission time Handle Problem Language Result Execution time Memory
638481 2022-09-06T08:57:18 Z TranGiaHuy1508 Permutation (APIO22_perm) C++17
88.2308 / 100
 3 ms 384 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};

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

	void solve(ll k){
		if (k == 1) return;
		for (int i = 0; i < (int)primes.size(); i++){
			if (k % primes[i] == 0){
				solve(k / primes[i]);
				mult(primes[i]);
				return;
			}
		}
		solve(k - 1);
		add(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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
78.230769228 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Partially correct 1 ms 212 KB Partially correct
5 Partially correct 1 ms 340 KB Partially correct
6 Partially correct 2 ms 340 KB Partially correct
7 Partially correct 2 ms 340 KB Partially correct
8 Partially correct 2 ms 340 KB Partially correct
9 Partially correct 2 ms 384 KB Partially correct
10 Partially correct 3 ms 340 KB Partially correct
11 Partially correct 2 ms 340 KB Partially correct
12 Partially correct 3 ms 340 KB Partially correct
13 Partially correct 2 ms 340 KB Partially correct