CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	Olli
Submission time:	2017-10-13 18:07:05 +0300
Language:	C++
Status:	READY
Result:	85

Feedback
group	verdict	score
#1	ACCEPTED	7
#2	WRONG ANSWER	0
#3	ACCEPTED	27
#4	ACCEPTED	51

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.06 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.05 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.05 s	1	details
#9	ACCEPTED	0.05 s	1	details
#10	ACCEPTED	0.04 s	1	details
#11	ACCEPTED	0.05 s	2	details
#12	WRONG ANSWER	0.05 s	2	details
#13	ACCEPTED	0.06 s	2	details
#14	ACCEPTED	0.05 s	2	details
#15	ACCEPTED	0.05 s	2	details
#16	ACCEPTED	0.06 s	2	details
#17	WRONG ANSWER	0.05 s	2	details
#18	ACCEPTED	0.07 s	2	details
#19	ACCEPTED	0.05 s	2	details
#20	ACCEPTED	0.06 s	2	details
#21	ACCEPTED	0.06 s	3	details
#22	ACCEPTED	0.06 s	3	details
#23	ACCEPTED	0.05 s	3	details
#24	ACCEPTED	0.06 s	3	details
#25	ACCEPTED	0.06 s	3	details
#26	ACCEPTED	0.05 s	3	details
#27	ACCEPTED	0.05 s	3	details
#28	ACCEPTED	0.07 s	3	details
#29	ACCEPTED	0.05 s	3	details
#30	ACCEPTED	0.05 s	3	details
#31	ACCEPTED	0.06 s	4	details
#32	ACCEPTED	0.29 s	4	details
#33	ACCEPTED	0.09 s	4	details
#34	ACCEPTED	0.21 s	4	details
#35	ACCEPTED	0.17 s	4	details
#36	ACCEPTED	0.13 s	4	details
#37	ACCEPTED	0.11 s	4	details
#38	ACCEPTED	0.26 s	4	details
#39	ACCEPTED	0.18 s	4	details
#40	ACCEPTED	0.28 s	4	details

Code

//Just for fun some more optimization

#include <iostream>
#include <queue>

using namespace std;

priority_queue <pair<pair<long long, long long>, pair<long long, string> > > numbers;

int fibonacci[35];

int main() {
    int n;
    cin >> n;
    fibonacci[0] = 1;
    fibonacci[1] = 1;
    for(int i = 2; i <= 34; i++) {
	fibonacci[i] = fibonacci[i-1] + fibonacci[i-2];
    }
    int max = 31;
    int j = 0;
    n++;
    numbers.push(make_pair(make_pair(1, 2), make_pair(1, "1")));
    string ans = "";
    while(!numbers.empty()) {
        long long moves = numbers.top().second.first;
	j++;
	if(moves >= max) {
	    numbers.pop();
	    continue;
	}


        long long a = numbers.top().first.first;
	long long b = numbers.top().first.second;
        string s = numbers.top().second.second;
        numbers.pop();
	if(2*b - a > n) {
	    continue;
	}
	if(fibonacci[max - moves - 1]*a + fibonacci[max - moves]*b + fibonacci[max - moves + 1] - 1 < n) {
	    continue;
	}


        if(a + b + 1 == n) {
            if(s.at(s.length() - 1) == '1') {
                ans = s + "0";
                max = moves;
            } else {
                ans = s + "1";
                max = moves;
            }
        } else if(2*b - a == n) {
            if(s.at(s.length() - 1) == '1') {
                ans = s + "1";
		max = moves;
            } else {
		ans = s + "0";
		max = moves;
            }
        }
	if(moves == max - 1) {
		continue;
	} else if(moves == max - 2) {
		if(a+2*b + 2 != n && 2*a+b+2 != n && 3*b - a + 1 != n && 3*b - 2*a != n) {
			continue;
		}
	} else if(moves == max - 3) {
		if(2*a + 3*b + 4 != n && a + 3*b + 3 != n && 3*a + 2*b + 4 != n && 3*a + b + 3 != n &&
		   5*b - 2*a + 2 != n && 4*b - a + 2 != n && 5*b - 3*a + 1 != n && 4*b - 3*a != n) {
			continue;
		}
	} else if(moves == max - 4) {
		if(3*a + 5*b + 7 != n && 3*a + 4*b + 6 != n && 2*a + 5*b + 6 != n && a + 4*b + 4 != n &&
		   5*a + 3*b + 7 != n && 4*a + 3*b + 6 != n && 5*a + 2*b + 6 != n && 4*a + b + 4 != n && 6*b - 3*a + 4 != n && 7*b - 3*a + 3 != n && 7*b - 2*a + 4 != n && 5*b - a + 3 != n && 8*b - 5*a + 2 != n && 8*b - 4*a + 2 != n && 7*b - 5*a + 1 != n && 5*b - 4*a != n) {
continue;
}
}
            string copy = s;
            if(s.at(s.length() - 1) == '1') {
		if(a+b+1 < n) {
			numbers.push(make_pair(make_pair(b, a+b+1), make_pair(moves+1, s + "0")));
		}
		numbers.push(make_pair(make_pair(b, 2*b-a), make_pair(moves+1, s + "1")));
            } else {
		if(a+b+1 < n) {
			numbers.push(make_pair(make_pair(b, a+b+1), make_pair(moves+1, s + "1")));
		}
		numbers.push(make_pair(make_pair(b, 2*b-a), make_pair(moves+1, s + "0")));
            }
            
            

    }
    cout << ans << "\n";
    cout << j << "\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 2` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`10` view save

user output
`10 2` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`1111` view save

user output
`1111 5` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`100 4` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`101 4` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`1000 6` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`1100` view save

user output
`1100 9` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`1101` view save

user output
`1011 6` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`1001 7` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`38` view save

correct output
`1101011` view save

user output
`1101011 52` view save

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`13` view save

correct output
`11011` view save

user output
`1000000 13` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`90` view save

correct output
`111001010` view save

user output
`101011000 24` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`25` view save

correct output
`110010` view save

user output
`101100 13` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`82` view save

correct output
`111001101` view save

user output
`101100111 77` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`94` view save

correct output
`1100011110` view save

user output
`1100011110 93` view save

Test 17

Group: 2

Verdict: WRONG ANSWER

input
`100` view save

correct output
`1111001001` view save

user output
`1011100000000 335` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`110010010` view save

user output
`101001110 48` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`110110010` view save

user output
`101000110 55` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`92` view save

correct output
`100110001` view save

user output
`100110001 70` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`1666` view save

correct output
`101101100100101` view save

user output
`101010101110110 119` view save

Test 22

Group: 3

Verdict: ACCEPTED

input
`897` view save

correct output
`11101001101010` view save

user output
`10101011100010 225` view save

Test 23

Group: 3

Verdict: ACCEPTED

input
`4466` view save

correct output
`111101010110100101` view save

user output
`101011010101111011 2943` view save

Test 24

Group: 3

Verdict: ACCEPTED

input
`4240` view save

correct output
`11011001011010101` view save

user output
`10101011010011011 1620` view save

Test 25

Group: 3

Verdict: ACCEPTED

input
`3089` view save

correct output
`1011001010100101` view save

user output
`1010010101001101 1556` view save

Test 26

Group: 3

Verdict: ACCEPTED

input
`4697` view save

correct output
`11010101101010110` view save

user output
`10101101101101010 707` view save

Test 27

Group: 3

Verdict: ACCEPTED

input
`4608` view save

correct output
`11010110101001010` view save

user output
`10101101010010100 6402` view save

Test 28

Group: 3

Verdict: ACCEPTED

input
`4625` view save

correct output
`111011001100101001` view save

user output
`101011100110101000 3159` view save

Test 29

Group: 3

Verdict: ACCEPTED

input
`4611` view save

correct output
`11010101010101100` view save

user output
`10101101011010100 220` view save

Test 30

Group: 3

Verdict: ACCEPTED

input
`4917` view save

correct output
`10110100101010110` view save

user output
`10110100101010110 3251` view save

Test 31

Group: 4

Verdict: ACCEPTED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
`1011010110110101010110110 53140` view save

Test 32

Group: 4

Verdict: ACCEPTED

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
`10100110001101010100110010010 959654` view save

Test 33

Group: 4

Verdict: ACCEPTED

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
`1010010110001010001010011 171705` view save

Test 34

Group: 4

Verdict: ACCEPTED

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
`1010010101100101010011010010 550398` view save

Test 35

Group: 4

Verdict: ACCEPTED

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
`1010101110001010110100100110 406722` view save

Test 36

Group: 4

Verdict: ACCEPTED

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
`10101011011001110101101010100 256777` view save

Test 37

Group: 4

Verdict: ACCEPTED

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
`10101011010100100110100111001 210374` view save

Test 38

Group: 4

Verdict: ACCEPTED

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
`1011010101011010101010101001 725397` view save

Test 39

Group: 4

Verdict: ACCEPTED

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
`10101101110010101101001010110 529282` view save

Test 40

Group: 4

Verdict: ACCEPTED

input
`911674` view save

correct output
`1010110010110101010101010110` view save

user output
`1001010101010101001011001010 968741` view save

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 (Olli)