#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) continue;
mult(primes[i]);
if (lim > 90){
revert_mult(primes[i]);
continue;
}
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
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 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Execution timed out |
1076 ms |
308 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |