CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:eliaskosunen
Submission time:2017-10-13 21:54:19 +0300
Language:C++
Status:READY
Result:7
Feedback
groupverdictscore
#1ACCEPTED7
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.07 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.07 s1details
#9ACCEPTED0.08 s1details
#10ACCEPTED0.07 s1details
#11ACCEPTED0.28 s2details
#12ACCEPTED0.07 s2details
#13--2details
#14ACCEPTED0.16 s2details
#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 <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#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() const {
        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 {
        if (bits.to_ullong() == b.bits.to_ullong()) {
            return len < b.len;
        }
        return bits.to_ullong() < b.bits.to_ullong();
    }
};

int ceil_log2(unsigned long long x) {
#ifndef __has_builtin
#define __has_builtin(x) 0
#endif

#if __has_builtin(__builtin_clzll)
#define FAST_LOG2(x)                      \
    (sizeof(unsigned long long) * 8 - 1 - \
     __builtin_clzll((unsigned long long)(x)))
#define FAST_LOG2_UP(x)                        \
    ({                                         \
        unsigned long long log = FAST_LOG2(x); \
        ((x) - (1 << log)) ? log + 1 : log;    \
    })
    return FAST_LOG2_UP(x);
    /* return ((sizeof(unsigned long long) * 8 - 1) - __builtin_clzll(x)) + */
    /*        (!!(x & (x - 1))); */
#else
    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;

#endif
}

std::set<bitset_type>& generate_all(int n) {
    static auto sets = [n]() -> std::set<bitset_type> {
        std::set<bitset_type> s;
        const auto max_i = n;
        for (auto i = 1; i <= max_i; ++i) {
            const auto cl2 = ceil_log2(i + 1);
            /* std::cout << i << '\n'; */
            s.emplace(i, cl2);
            for (auto l = cl2 + 1; l <= cl2 + 3; ++l) {
                s.emplace(i, l);
            }
            for (auto j = 2; j <= 16; j *= 2) {
                s.emplace(i + j, ceil_log2(i + j + 1));
            }
        }
        /* 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::set<std::string>& subseqs, char* prefix,
                  int prefixLength, const char* suffix) {
    if (prefixLength >= 1) {
        subseqs.emplace(prefix);
    }
    for (size_t i = 0; i < std::strlen(suffix); ++i) {
        prefix[prefixLength] = suffix[i];
        prefix[prefixLength + 1] = '\0';
        subsequences(subseqs, prefix, prefixLength + 1, suffix + i + 1);
    }
}

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

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

    std::map<int, bitset_type> map;
    const auto mul = [n]() -> int {
        if (n == 1) {
            return 1;
        }
        if (n <= 10) {
            return n * n;
        }
        /* if (n < 5) { */
        /*     return n * n; */
        /* } */
        if (n <= 100) {
            return n * 8;
        }
        return n * 4;
        /* return n * (ceil_log2(n) - 1); */
    }();
    for (auto& b : generate_all(mul)) {
        /* std::cout << b.str() << ":\t\t"; */
        /* std::cout << b.str() << ":\n"; */

        std::set<std::string> subs;
        /* subs.reserve(n * n); */
        auto prefix = new char[b.str().length() + 1];
        /* char* prefix = (char*)malloc(b.len + 1); */
        /* subsequences(subs, prefix, b.str()); */
        subsequences(subs, prefix, 0, b.str().c_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();
        /* for (auto& s : subs) { */
        /*     std::cout << '\t' << s << '\n'; */
        /* } */
        /* 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;
            }
        }
        delete[] prefix;
    }
    /* for (auto& m : map) { */
    /*     std::cout << m.first << ":\t\t" << m.second.str() << '\n'; */
    /* } */
    auto key = map.find(n);
    assert(key != map.end());
    std::cout << key->second.str() << '\n';
    /* std::cout << map[n].str() << '\n'; */
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
11

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
10

user output
01

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
1111

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
001

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
010

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
0001

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
0011

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
0010

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
0110

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
0010100

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
00100

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
(empty)

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
001101

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)