CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:inkeri
Submission time:2017-10-11 19:01:20 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#30.04 s1details
#40.06 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.05 s1details
#70.07 s1details
#80.04 s1details
#9ACCEPTED0.06 s1details
#100.05 s1details
#110.06 s2details
#120.06 s2details
#130.07 s2details
#140.07 s2details
#150.03 s2details
#160.06 s2details
#170.07 s2details
#180.05 s2details
#190.06 s2details
#200.04 s2details
#210.06 s3details
#220.05 s3details
#230.14 s3details
#240.12 s3details
#250.09 s3details
#260.14 s3details
#270.12 s3details
#280.13 s3details
#290.14 s3details
#300.11 s3details
#31--4details
#32--4details
#33--4details
#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
//kokonaisSumma: listan kokonaissumma
//raja: raja listan pituudelle (missä vaiheessa lopetetaan etsintä)

array<char, 30> lyhinjono(ll tavoite, deque<int> lista, ll viimeinen, ll summa, ll kokonaissumma, ll raja) {
    int length = lista.size();
    if (kokonaissumma == tavoite) {
        array<char, 30> bittijono;
        int alku = 30 - length;
        char edellinenBitti = '0';
        ll edellinenLuku = 0;
        for (int i = 0; i < length; i++) {
            ll luku = lista.front();
            lista.pop_front();
            if (luku == edellinenLuku) {
                bittijono[alku + i] = edellinenBitti;
            } else {
                edellinenLuku = luku;
                if (edellinenBitti == '0') {
                    bittijono[alku + i] = edellinenBitti = '1';
                } else {
                    bittijono[alku + i] = edellinenBitti = '0';
                }
            }
        }
        return bittijono;
    }
    if (kokonaissumma > tavoite || length >= raja) {
        array<char, 30> bittijono;
        bittijono.fill('a');
        return bittijono;
    }
    //lisätään eri luku, arvo kasvaa summalla
    lista.push_back(summa);
    array<char, 30> jono1 = lyhinjono(tavoite, lista, summa, summa + viimeinen, kokonaissumma + summa, raja);
    if (jono1[0] != 'a') {
        for (ll i = 0; i < 30; i++) {
            if (jono1[i] == '1') {
                if (30 - i < raja) {
                    raja = 30 - i;
                }
                break;
            }
        }
    }
    lista.pop_back();
    lista.push_back(viimeinen);
    array<char, 30> jono2 = lyhinjono(tavoite, lista, viimeinen, summa + viimeinen, kokonaissumma + viimeinen, raja);
    if (jono2[0] != 'a') {
        return jono2;
    }
    return jono1;
}

int main() {
    ll tavoite;
    cin >> tavoite;
    ll pituus = 1;
    ll summa = 1;
    ll a = 1;
    ll b = 1;
    while (summa < tavoite) {
        pituus++;
        ll c = a;
        a += b;
        b = c;
        summa += a;
    }
    deque<int> lista;
    lista.push_back(1);
    array<char, 30> jono = lyhinjono(tavoite, lista, 1, 2, 1, pituus + 2);
    for (int i = 0; i < 30; i++) {
        if (jono[i] == '1') {
            a = i;
            break;
        }
    }
    for (int i = a; i < 30; i++) {
        cout << jono[i];
    }
    cout << 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:

input
3

correct output
10

user output
1l{10

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
aaaaaaaaaaaaaaaaaaaaaaaaaaa

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:

input
7

correct output
1110

user output
aaaaaaaaaaaaaaaaaaaaaaaaa

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
aaaaaaaaaaaaaaaaaaaaaaaaa

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
1011

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
aaaaaaaaaaaaaaaaaaaaaaaaa

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
aaaaaaaaa

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
aaaaaaaaaaaaaaaaaaaaaa

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
aaaaaaaaaaaaaaaaa

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)