CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:inkeri
Submission time:2017-10-15 23:08:32 +0300
Language:C++
Status:READY
Result:49
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#3ACCEPTED27
#40
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.08 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.06 s1details
#10ACCEPTED0.07 s1details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.06 s2details
#13ACCEPTED0.04 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.06 s2details
#16ACCEPTED0.07 s2details
#17ACCEPTED0.07 s2details
#18ACCEPTED0.06 s2details
#19ACCEPTED0.06 s2details
#20ACCEPTED0.05 s2details
#21ACCEPTED0.06 s3details
#22ACCEPTED0.05 s3details
#23ACCEPTED0.06 s3details
#24ACCEPTED0.06 s3details
#25ACCEPTED0.07 s3details
#26ACCEPTED0.04 s3details
#27ACCEPTED0.06 s3details
#28ACCEPTED0.06 s3details
#29ACCEPTED0.05 s3details
#30ACCEPTED0.07 s3details
#31ACCEPTED0.50 s4details
#32--4details
#33ACCEPTED0.45 s4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Code

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

//tavoite: tavoiteltava summa
//lista: lisätyt luvut
//viimeinen: listan viimeinen luku
//summa: lisättävä summa jos lisätään eri luku kuin viimeinen
//maara: alijonojen määrä
//raja: raja listan pituudelle (missä vaiheessa lopetetaan etsintä)
//mikä bitti lisätty viimeksi
array<ll,2> lyhinjono(ll tavoite, ll arvo, ll viimeinen, ll summa, ll maara, ll raja, ll pituus, int bitti) {
    if (maara > tavoite || pituus > raja) {
        return {0,0};
    }
    if (maara == tavoite) {
        return {arvo, pituus};
    }
    /*
    ll pituus = 1;
    ll maara = 1;
    ll prev0 = 2;
    ll prev1 = 1;
    while (maara < tavoite) {
        pituus++;
        if (pituus % 2 == 1) {
            maara += prev1;
            prev0 += prev1;
        } else {
            maara += prev0;
            prev1 += prev0;
        }
    }*/
    pituus++;
    int uusiBitti = 1;
    if (bitti == 1) {
        uusiBitti = 0;
    }
    arvo *= 2;
    //lisätään eri luku, arvo kasvaa summalla
    array<ll, 2> jono1 = lyhinjono(tavoite, arvo + uusiBitti, summa, summa + viimeinen, maara + summa, raja, pituus, uusiBitti);
    if (jono1[0] != 0) {
        raja = jono1[1];
    }
    //lisätään sama luku, arvo kasvaa samalla kuin viimeksi
    array<ll, 2> jono2 = lyhinjono(tavoite, arvo + bitti, viimeinen, summa + viimeinen, maara + viimeinen, raja, pituus, bitti);
    if (jono2[0] != 0) {
        return jono2;
    }
    return jono1;
}

int main() {
    ll tavoite;
    cin >> tavoite;
    /*
    ll pituus = 1;
    ll maara = 1;
    ll prev0 = 2;
    ll prev1 = 1;
    while (maara < tavoite) {
        pituus++;
        if (pituus % 2 == 1) {
            maara += prev1;
            prev0 += prev1;
        } else {
            maara += prev0;
            prev1 += prev0;
        }
    }
    ll pituus = 1;
    ll a = 1;
    ll b = 1;
    ll maara = 1;
    while (maara < tavoite) {
        pituus++;
        ll c = a;
        a += b;
        b = c;
        maara += a;
    }
    ll minimi = 1;
    ll maksimi = 28;
    while (minimi != maksimi) {
        ll pituus = ll((minimi + maksimi) / 2);
        ll arvo = 1;
        for (ll i = 0; i < pituus - 1; i++) {
            arvo*=2;
            arvo+=(i%2);
        }
        string jono = bitset<29>(arvo).to_string();
        jono.erase(0, 29 - pituus);
        if (alijonot(jono) >= tavoite) {
            maksimi = pituus;
        } else {
            minimi = pituus + 1;
        }
    }
    ll pituus = minimi;

    ll pituus = 28;
    ll summa = 832038;
    ll a = 317811;
    ll b = 196418;
    while (summa > tavoite) {
        summa -= a;
        ll c = b;
        b = a - b;
        a = c;
        pituus--;
    }
    */
    array<ll, 2> jono = lyhinjono(tavoite, 1, 1, 2, 1, 30, 1, 1);
    string bittijono = bitset<30>(jono[0]).to_string();
    bittijono.erase(0, 30 - jono[1]);
    cout << bittijono << endl;
}

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
10

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
110

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
1110

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
1100

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
1101

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
1001

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
1101011

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
11011

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
111001010

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
110010

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
111001101

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1100011110

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1111001001

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
110010010

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
110110010

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
100011001

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
100100010101010

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
11101001101010

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
111101010110100101

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
11011001011010101

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
1011001010100101

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
11010101101010110

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
11010110101001010

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
111001010100100100

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
11001010101010100

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
10010101011010010

Test 31

Group: 4

Verdict: ACCEPTED

input
178555

correct output
1011010110110101010110110

user output
1001001010101001001010010

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Test 33

Group: 4

Verdict: ACCEPTED

input
112146

correct output
1101110101011001100100110

user output
1100010101010110110111001

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)