oj.uz

Submission #862485

# Submission time Handle Problem Language Result Execution time Memory
862485 2023-10-18T10:30:30 Z JakobZorz Permutation (APIO22_perm) C++17
100 / 100
 2 ms 524 KB 
#include<iostream>
#include"perm.h"
using namespace std;
typedef long long ll;


vector<int>construct_permutation(ll k){
    if(k==1)
        return {};
    if(k==2)
        return {0};
    
    for(int p:{2,3,5,7,11,13,17,19,23}){
        if(k%p==0&&p<k){
            auto a=construct_permutation(p);
            auto b=construct_permutation(k/p);
            int s=(int)a.size();
            for(int i:b)
                a.push_back(i+s);
            return a;
        }
    }
    
    auto a=construct_permutation(k/2);
    a.push_back((int)a.size());
    a.insert(a.begin(),(int)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 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 524 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct