oj.uz

Submission #908581

# Submission time Handle Problem Language Result Execution time Memory
908581 2024-01-16T14:43:03 Z vjudge1 Permutation (APIO22_perm) C++17
100 / 100
 2 ms 604 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;

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

Subtask #1
10.0 / 10.0

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

Subtask #2
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 604 KB Output is correct