oj.uz

Submission #829983

# Submission time Handle Problem Language Result Execution time Memory
829983 2023-08-18T16:36:28 Z dolphingarlic Permutation (APIO22_perm) C++17
100 / 100
 7 ms 340 KB 
#include "perm.h"

#include <bits/stdc++.h>
using namespace std;

vector<int> construct_permutation(long long k) {
    int bit = 64 - __builtin_clzll(k);
    vector<double> ans;
    bool flag = false;
    while (bit > 0) {
        bit -= 2;
        if (bit == -1) {
            ans.push_back(1e9);
            if (k & 1) ans.push_back(-1e9);
        } else {
            int val = (k >> bit) & 3;
            if (ans.empty()) {
                if (val == 2) ans = {0};
                else ans = {1, 0}, flag = true;
            } else {
                if (val == 0) {
                    ans.push_back(1e9);
                    ans.push_back(1e9 + 1);
                } else if (val == 1) {
                    ans.push_back(1e9);
                    ans.push_back(1e9 + 1);
                    ans.push_back(-1e9);
                    flag = true;
                } else if (val == 2) {
                    ans.push_back(1e9);
                    ans.push_back(-1e9);
                    ans.push_back(1e9 + 1);
                    flag = true;
                } else {
                    if (!flag) {
                        ans.push_back(1e9);
                        ans.push_back(-1e9);
                        ans.push_back(1e9 + 1);
                        ans.push_back(-1e9 - 1);
                        flag = true;
                    } else {
                        ans.push_back(1e9);
                        ans.push_back(1e9 + 1);
                        ans.push_back(1.5);
                    }
                }
            }
        }
        vector<double> uni(ans.begin(), ans.end());
        sort(uni.begin(), uni.end());
        for (auto &it : ans)
            it = lower_bound(uni.begin(), uni.end(), it) - uni.begin();
    }

    return vector<int>(ans.begin(), ans.end());
}

Subtask #1
10.0 / 10.0

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

Subtask #2
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 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 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 300 KB Output is correct
7 Correct 5 ms 296 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct