oj.uz

Submission #657333

# Submission time Handle Problem Language Result Execution time Memory
657333 2022-11-09T14:38:02 Z couplefire Permutation (APIO22_perm) C++17
100 / 100
 2 ms 340 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

vector<int> construct_permutation(ll k){
	if (k == 1ll) return {};
	if (k == 2ll) return {0};
	for (int p : {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31}) 
		if (k%p == 0ll && k > p) {
			vector<int> a = construct_permutation(p);
			vector<int> b = construct_permutation(k/p);
			for (auto& x : b)
				x += a.size();
			a.insert(a.end(), b.begin(), b.end());
			return a;
		}
	vector<int> res = construct_permutation(k >> 1ll);
	res.push_back(res.size());
	res.insert(res.begin(), res.size());
	return res;
}

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
90.0 / 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 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 296 KB Output is correct