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

Code

//I think this is about k*log(k), where k is at most about 4*1e6, but still local testing can take up to 10 seconds. It's worth a shot anyways.
//It's known that the code won't work with n = 1.

#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;
	}
	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;
		}
	}
            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";
}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
(empty)

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
100

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
1000

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
1011

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
101011000

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
101100

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
101100111

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1000011100

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1001001111

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
101001110

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
101000110

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
100110001

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
101010101110110

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
10101011100010

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
101011010101111011

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
10101011010011011

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
1010010101001101

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
10101001001001010

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
10101101010010100

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
101011100110101000

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
10101101011010100

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
10110100101010110

Test 31

Group: 4

Verdict: ACCEPTED

input
178555

correct output
1011010110110101010110110

user output
1011010110110101010110110

Test 32

Group: 4

Verdict: ACCEPTED

input
864856

correct output
10111010110110100100101010010

user output
10100110001101010100110010010

Test 33

Group: 4

Verdict: ACCEPTED

input
112146

correct output
1101110101011001100100110

user output
1010010110001010001010011

Test 34

Group: 4

Verdict: ACCEPTED

input
741124

correct output
1011010011010101100101011010

user output
1010010101100101010011010010

Test 35

Group: 4

Verdict: ACCEPTED

input
511902

correct output
1011010100011010100101001110

user output
1010101110001010110100100110

Test 36

Group: 4

Verdict: ACCEPTED

input
920019

correct output
11100100101101010101001101010

user output
10101010101001011101001100100

Test 37

Group: 4

Verdict: ACCEPTED

input
933943

correct output
10101011010100100110100111001

user output
10101011010100100110100111001

Test 38

Group: 4

Verdict: ACCEPTED

input
973410

correct output
1011010101011010101010101001

user output
1011010101011010101010101001

Test 39

Group: 4

Verdict: ACCEPTED

input
954943

correct output
10110110010011010100100110101

user output
10101101110010101101001010110

Test 40

Group: 4

Verdict: ACCEPTED

input
911674

correct output
1010110010110101010101010110

user output
1010110010110101010101010110