oj.uz

Submission #866705

# Submission time Handle Problem Language Result Execution time Memory
866705 2023-10-26T19:06:43 Z Dec0Dedd Permutation (APIO22_perm) C++17
100 / 100
 2 ms 352 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<int> construct_permutation(ll k) {
    if (k == 1) return {};
    if (k == 2) return vector<int>{0};

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

    vector<int> 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 0 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 0 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 352 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct