CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	eliaskosunen
Submission time:	2017-10-14 12:37:22 +0300
Language:	C++
Status:	READY
Result:	7

Feedback
group	verdict	score
#1	ACCEPTED	7
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.06 s	1	details
#2	ACCEPTED	0.06 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.07 s	1	details
#5	ACCEPTED	0.06 s	1	details
#6	ACCEPTED	0.05 s	1	details
#7	ACCEPTED	0.06 s	1	details
#8	ACCEPTED	0.07 s	1	details
#9	ACCEPTED	0.08 s	1	details
#10	ACCEPTED	0.10 s	1	details
#11	ACCEPTED	0.34 s	2	details
#12	ACCEPTED	0.09 s	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	ACCEPTED	0.16 s	2	details
#15	ACCEPTED	0.98 s	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	3	details
#23	TIME LIMIT EXCEEDED	--	3	details
#24	TIME LIMIT EXCEEDED	--	3	details
#25	TIME LIMIT EXCEEDED	--	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	TIME LIMIT EXCEEDED	--	3	details
#28	TIME LIMIT EXCEEDED	--	3	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details
#31	TIME LIMIT EXCEEDED	--	4	details
#32	TIME LIMIT EXCEEDED	--	4	details
#33	TIME LIMIT EXCEEDED	--	4	details
#34	TIME LIMIT EXCEEDED	--	4	details
#35	TIME LIMIT EXCEEDED	--	4	details
#36	TIME LIMIT EXCEEDED	--	4	details
#37	TIME LIMIT EXCEEDED	--	4	details
#38	TIME LIMIT EXCEEDED	--	4	details
#39	TIME LIMIT EXCEEDED	--	4	details
#40	TIME LIMIT EXCEEDED	--	4	details

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{}; */
    uint64_t 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 = std::bitset<64>{bits}.to_string();
        return s.substr(s.size() - len);
    }

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

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(uint64_t b, uint64_t n) {
    static auto sets = [b, n]() -> std::set<bitset_type> {
        std::set<bitset_type> s;
        const uint64_t max_i = n;
        for (uint64_t i = b; 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);
                /* { */
                /*     auto tmp = i; */
                /*     tmp ^= 1 << (l - 1); */
                /*     s.emplace(tmp, l); */
                /* } */
                s.emplace(std::bitset<64>{i}.set(l - 1).to_ullong(), l);
                /* { */
                /*     auto tmp = i; */
                /*     tmp ^= 1 << (l - 1); */
                /*     tmp ^= 1 << (l - 2); */
                /*     s.emplace(tmp, l); */
                /* } */
                /* s.emplace( */
                /* std::bitset<64>{i}.flip(l - 1).flip(l - 2).to_ullong(), l); */
            }
            /* for (auto j = 2; j <= 8; 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'; */
    uint64_t n = 100;
    std::cin >> n;

    std::map<int, bitset_type> map;
    const auto mul = [n]() -> uint64_t {
        if (n == 1) {
            return 1;
        }
        if (n <= 10) {
            return n * n;
        }
        /* if (n < 5) { */
        /*     return n * n; */
        /* } */
        if (n <= 100) {
            return n * 6;
        }
        return n * 4;
        /* return n * (ceil_log2(n) - 1); */
    }();
    const auto beg = [n]() -> uint64_t {
        if (n <= 50) {
            return 1;
        }
        return n / 16;
    }();
    for (auto& b : generate_all(beg, 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` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2` view save

correct output
`11` view save

user output
`11` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`10` view save

user output
`01` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`1111` view save

user output
`1111` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`001` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`010` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`0001` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`1100` view save

user output
`0011` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`1101` view save

user output
`0010` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`0110` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`38` view save

correct output
`1101011` view save

user output
`0010100` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`13` view save

correct output
`11011` view save

user output
`00100` view save

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`90` view save

correct output
`111001010` view save

user output
(empty)

Test 14

Group: 2

Verdict: ACCEPTED

input
`25` view save

correct output
`110010` view save

user output
`001101` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`82` view save

correct output
`111001101` view save

user output
`000110010` view save

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`94` view save

correct output
`1100011110` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100` view save

correct output
`1111001001` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`99` view save

correct output
`110010010` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`98` view save

correct output
`110110010` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`92` view save

correct output
`100110001` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1666` view save

correct output
`101101100100101` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`897` view save

correct output
`11101001101010` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4466` view save

correct output
`111101010110100101` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4240` view save

correct output
`11011001011010101` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`3089` view save

correct output
`1011001010100101` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4697` view save

correct output
`11010101101010110` view save

user output
(empty)

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4608` view save

correct output
`11010110101001010` view save

user output
(empty)

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4625` view save

correct output
`111011001100101001` view save

user output
(empty)

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4611` view save

correct output
`11010101010101100` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4917` view save

correct output
`10110100101010110` view save

user output
(empty)

Test 31

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
(empty)

Test 32

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
(empty)

Test 33

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
(empty)

Test 34

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
(empty)

Test 35

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
(empty)

Test 36

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
(empty)

Test 37

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
(empty)

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
(empty)

Test 39

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
(empty)

Test 40

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`911674` view save

correct output
`1010110010110101010101010110` view save

user output
(empty)

Datatähti 2018 alku

Bittijono

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Tasks

Submissions (eliaskosunen)