CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:eliaskosunen
Submission time:2017-10-13 20:03:14 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1--1details
#2--1details
#3--1details
#4--1details
#5--1details
#6--1details
#7--1details
#8--1details
#9--1details
#10--1details
#11--2details
#12--2details
#13--2details
#14--2details
#15--2details
#16--2details
#17--2details
#18--2details
#19--2details
#20--2details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28--3details
#29--3details
#30--3details
#31--4details
#32--4details
#33--4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Code

#include <algorithm>
#include <array>
#include <bitset>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>

/* using bitset_type = std::bitset<64>; */
struct bitset_type {
    std::bitset<64> bits{};
    std::size_t len{};

    constexpr bitset_type() = default;
    constexpr bitset_type(uint64_t val, std::size_t l) : bits(val), len(l) {}

    std::string str() {
        auto s = bits.to_string();
        return s.substr(s.size() - len);
    }

    bool operator==(const bitset_type& b) const {
        return bits.to_ullong() == b.bits.to_ullong() && len == b.len;
    }
    bool operator<(const bitset_type& b) const {
        return bits.to_ullong() < b.bits.to_ullong() && len < b.len;
    }
};

template <int N>
struct bitseq;

template <>
struct bitseq<1> {
    static constexpr bitset_type val() { return bitset_type(1, 1); }
};

template <>
struct bitseq<2> {
    static constexpr bitset_type val() {
        return bitset_type(3, 2);  // 0b11
    }
};

template <>
struct bitseq<3> {
    static constexpr bitset_type val() {
        return bitset_type(2, 2);  // 0b10
    }
};

template <>
struct bitseq<4> {
    static constexpr bitset_type val() {
        return bitset_type(15, 4);  // 0b1111
    }
};

template <>
struct bitseq<5> {
    static constexpr bitset_type val() {
        return bitset_type(4, 3);  // 0b100
    }
};

template <>
struct bitseq<6> {
    static constexpr bitset_type val() {
        return bitset_type(5, 3);  // 0b101
    }
};

template <>
struct bitseq<7> {
    static constexpr bitset_type val() {
        return bitset_type(2, 4);  // 0b0010
    }
};

template <>
struct bitseq<8> {
    static constexpr bitset_type val() {
        return bitset_type(3, 4);  // 0b0011
    }
};

template <>
struct bitseq<9> {
    static constexpr bitset_type val() {
        return bitset_type(5, 4);  // 0b0101
    }
};

int ceil_log2(unsigned long long x) {
    static const unsigned long long t[6] = {
        0xFFFFFFFF00000000ull, 0x00000000FFFF0000ull, 0x000000000000FF00ull,
        0x00000000000000F0ull, 0x000000000000000Cull, 0x0000000000000002ull};

    int y = (((x & (x - 1)) == 0) ? 0 : 1);
    int j = 32;
    int i;

    for (i = 0; i < 6; i++) {
        int k = (((x & t[i]) == 0) ? 0 : j);
        y += k;
        x >>= k;
        j >>= 1;
    }

    return y;
}

std::vector<bitset_type>& generate_all() {
    static auto sets = []() -> std::vector<bitset_type> {
        std::vector<bitset_type> s;
        /* auto len = [](int n) { */
        /*     if(n == 0) { */
        /*         return 0; */
        /*     } */
        /*     return __builtin_clz(n) + 1; */
        /* }; */
        for (auto i = 1; i <= 0x7f; ++i) {
            const auto cl2 = ceil_log2(i + 1);
            for (auto l = cl2; l <= 8 + cl2; ++l) {
                if (l == 0) continue;
                s.emplace_back(i, l);
            }
        }
        std::sort(s.begin(), s.end());
        auto last = std::unique(s.begin(), s.end());
        s.erase(last, s.end());
        return s;
    }();
    return sets;
}

void subsequences(std::vector<std::string>& subseqs, const std::string& prefix,
                  const std::string& suffix) {
    if (prefix.length() >= 2) subseqs.push_back(prefix);
    for (std::size_t i = 0; i < suffix.length(); ++i) {
        subsequences(subseqs, prefix + suffix[i], suffix.substr(i + 1));
    }
}

bitset_type get(int n) {
    static std::array<bitset_type, 10> cache{
        {bitseq<1>::val(), bitseq<2>::val(), bitseq<3>::val(), bitseq<4>::val(),
         bitseq<5>::val(), bitseq<6>::val(), bitseq<7>::val(), bitseq<8>::val(),
         bitseq<9>::val()}};
    return cache[n - 1];
}

int main() {
    /* int n; */
    /* std::cin >> n; */
    /* std::cout << get(n).str() << '\n'; */

    std::unordered_map<int, bitset_type> map;
    for (auto& b : generate_all()) {
        /* std::cout << b.str() << ":\t\t"; */

        std::vector<std::string> subs;
        std::string prefix(10, '\0');
        subsequences(subs, prefix, b.str());
        std::sort(subs.begin(), subs.end());
        auto last = std::unique(subs.begin(), subs.end());
        subs.erase(last, subs.end());
        const auto size = subs.size() - 1;
        /* std::cout << size << '\n'; */

        auto key = map.find(size);
        if (key == map.end()) {
            map.insert({size, b});
        } else {
            if (key->second.len > size) {
                key->second = b;
            }
        }
    }
    /* for (auto& m : map) { */
    /*     std::cout << m.first << ":\t\t" << m.second.str() << '\n'; */
    /* } */
    int n;
    std::cin >> n;
    std::cout << map[n].str() << '\n';
}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
(empty)

Test 2

Group: 1

Verdict:

input
2

correct output
11

user output
(empty)

Test 3

Group: 1

Verdict:

input
3

correct output
10

user output
(empty)

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
(empty)

Test 5

Group: 1

Verdict:

input
5

correct output
110

user output
(empty)

Test 6

Group: 1

Verdict:

input
6

correct output
101

user output
(empty)

Test 7

Group: 1

Verdict:

input
7

correct output
1110

user output
(empty)

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
(empty)

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
(empty)

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
(empty)

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
(empty)

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
(empty)

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
(empty)

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
(empty)

Test 15

Group: 2

Verdict:

input
82

correct output
111001101

user output
(empty)

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
(empty)

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
(empty)

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
(empty)

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
(empty)

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
(empty)

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
(empty)

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
(empty)

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
(empty)

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
(empty)

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
(empty)

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
(empty)

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
(empty)

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
(empty)

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
(empty)

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
(empty)

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
(empty)

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
(empty)

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
(empty)

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
(empty)

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
(empty)

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
(empty)

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
(empty)

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
(empty)