oj.uz

Submission #572702

# Submission time Handle Problem Language Result Execution time Memory
572702 2022-06-05T06:24:47 Z baluteshih Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 340 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

vector<int> construct_permutation(ll k) {
    if (k == 1)
        return {};
    if (k == 2)
        return {0};
    if (k & 1) {
        vector<int> rt = construct_permutation(k - 1);
        for (int &i : rt)
            ++i;
        rt.pb(0);
        return rt;
    }
    vector<int> rt = construct_permutation(k / 2);
    rt.pb(SZ(rt));
    return rt;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 Partially correct 2 ms 340 KB Partially correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Partially correct 1 ms 340 KB Partially correct
9 Correct 1 ms 340 KB Output is correct
10 Partially correct 2 ms 340 KB Partially correct
11 Partially correct 2 ms 340 KB Partially correct
12 Partially correct 1 ms 340 KB Partially correct
13 Partially correct 2 ms 340 KB Partially correct