oj.uz

Submission #976119

# Submission time Handle Problem Language Result Execution time Memory
976119 2024-05-06T07:52:59 Z rythm_of_knight Permutation (APIO22_perm) C++17
0 / 100
 1 ms 348 KB 
#include "perm.h"
#include <vector>
#include <algorithm>
std::vector<int> construct_permutation(long long k) {
	#define int long long
	using namespace std;
    int temp = --k;
    vector <int> v;
    while (temp) {
        v.push_back(temp & 1);
        temp >>= 1;
    }
    int sz = v.size();
    for (int i = 0; i < sz; i++) {
        while (i > 0 && v[i - 1] == 0 && v[i] > 0) {
            v[i - 1] += 2;
            v[i]--;
            i--;
        }
    }
    int cnt = -1;
    vector <signed> ans;
    for (int i = 0; i < sz; i++) {
        vector <int> t;
        while (v[i]--) {
            t.push_back(++cnt);
        }
        reverse(t.begin(), t.end());
        for (int &u : t) {
            ans.push_back(u);
        }
    }
    return ans;
}

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -