Code Submission Evaluation System Login

Datatähti 2018 alku

Start:2017-10-02 00:00:00
End:2017-10-16 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2018 alku - Results
History
2017-10-13 20:33:47100
2017-10-13 18:07:0585
2017-10-13 17:03:1493
2017-10-13 16:54:2242
2017-10-13 16:39:3442
2017-10-08 10:32:3042
Task:Bittijono
Sender:Olli
Submission time:2017-10-13 20:33:47
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#3ACCEPTED27
#4ACCEPTED51

Test results

testverdicttime (s)group
#1ACCEPTED0.04 / 1.001details
#2ACCEPTED0.06 / 1.001details
#3ACCEPTED0.06 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.06 / 1.001details
#6ACCEPTED0.07 / 1.001details
#7ACCEPTED0.05 / 1.001details
#8ACCEPTED0.04 / 1.001details
#9ACCEPTED0.05 / 1.001details
#10ACCEPTED0.05 / 1.001details
#11ACCEPTED0.08 / 1.002details
#12ACCEPTED0.07 / 1.002details
#13ACCEPTED0.04 / 1.002details
#14ACCEPTED0.04 / 1.002details
#15ACCEPTED0.06 / 1.002details
#16ACCEPTED0.05 / 1.002details
#17ACCEPTED0.06 / 1.002details
#18ACCEPTED0.06 / 1.002details
#19ACCEPTED0.05 / 1.002details
#20ACCEPTED0.05 / 1.002details
#21ACCEPTED0.06 / 1.003details
#22ACCEPTED0.05 / 1.003details
#23ACCEPTED0.06 / 1.003details
#24ACCEPTED0.05 / 1.003details
#25ACCEPTED0.04 / 1.003details
#26ACCEPTED0.05 / 1.003details
#27ACCEPTED0.05 / 1.003details
#28ACCEPTED0.07 / 1.003details
#29ACCEPTED0.05 / 1.003details
#30ACCEPTED0.05 / 1.003details
#31ACCEPTED0.07 / 1.004details
#32ACCEPTED0.79 / 1.004details
#33ACCEPTED0.14 / 1.004details
#34ACCEPTED0.39 / 1.004details
#35ACCEPTED0.18 / 1.004details
#36ACCEPTED0.06 / 1.004details
#37ACCEPTED0.20 / 1.004details
#38ACCEPTED0.49 / 1.004details
#39ACCEPTED0.41 / 1.004details
#40ACCEPTED0.18 / 1.004details

Code

#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;
if(n == 1) {
	cout << "0" << "\n";
	return 0;
}
    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: ACCEPTED

input
1
view   save

correct output
1
view   save

user output
0
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
10
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
100
view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
6
view   save

correct output
101
view   save

user output
101
view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
7
view   save

correct output
1110
view   save

user output
1000
view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
8
view   save

correct output
1100
view   save

user output
1100
view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
9
view   save

correct output
1101
view   save

user output
1011
view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
10
view   save

correct output
1001
view   save

user output
1001
view   save

Test 11

Group: 2

Verdict: ACCEPTED

input
38
view   save

correct output
1101011
view   save

user output
1101011
view   save

Test 12

Group: 2

Verdict: ACCEPTED

input
13
view   save

correct output
11011
view   save

user output
11011
view   save

Test 13

Group: 2

Verdict: ACCEPTED

input
90
view   save

correct output
111001010
view   save

user output
101011000
view   save

Test 14

Group: 2

Verdict: ACCEPTED

input
25
view   save

correct output
110010
view   save

user output
101100
view   save

Test 15

Group: 2

Verdict: ACCEPTED

input
82
view   save

correct output
111001101
view   save

user output
101100111
view   save

Test 16

Group: 2

Verdict: ACCEPTED

input
94
view   save

correct output
1100011110
view   save

user output
1000011100
view   save

Test 17

Group: 2

Verdict: ACCEPTED

input
100
view   save

correct output
1111001001
view   save

user output
1001001111
view   save

Test 18

Group: 2

Verdict: ACCEPTED

input
99
view   save

correct output
110010010
view   save

user output
101001110
view   save

Test 19

Group: 2

Verdict: ACCEPTED

input
98
view   save

correct output
110110010
view   save

user output
101000110
view   save

Test 20

Group: 2

Verdict: ACCEPTED

input
92
view   save

correct output
100110001
view   save

user output
100110001
view   save

Test 21

Group: 3

Verdict: ACCEPTED

input
1666
view   save

correct output
101101100100101
view   save

user output
101010101110110
view   save

Test 22

Group: 3

Verdict: ACCEPTED

input
897
view   save

correct output
11101001101010
view   save

user output
10101011100010
view   save

Test 23

Group: 3

Verdict: ACCEPTED

input
4466
view   save

correct output
111101010110100101
view   save

user output
101011010101111011
view   save

Test 24

Group: 3

Verdict: ACCEPTED

input
4240
view   save

correct output
11011001011010101
view   save

user output
10101011010011011
view   save

Test 25

Group: 3

Verdict: ACCEPTED

input
3089
view   save

correct output
1011001010100101
view   save

user output
1010010101001101
view   save

Test 26

Group: 3

Verdict: ACCEPTED

input
4697
view   save

correct output
11010101101010110
view   save

user output
10101001001001010
view   save

Test 27

Group: 3

Verdict: ACCEPTED

input
4608
view   save

correct output
11010110101001010
view   save

user output
10101101010010100
view   save

Test 28

Group: 3

Verdict: ACCEPTED

input
4625
view   save

correct output
111011001100101001
view   save

user output
101011100110101000
view   save

Test 29

Group: 3

Verdict: ACCEPTED

input
4611
view   save

correct output
11010101010101100
view   save

user output
10101101011010100
view   save

Test 30

Group: 3

Verdict: ACCEPTED

input
4917
view   save

correct output
10110100101010110
view   save

user output
10110100101010110
view   save

Test 31

Group: 4

Verdict: ACCEPTED

input
178555
view   save

correct output
1011010110110101010110110
view   save

user output
1011010110110101010110110
view   save

Test 32

Group: 4

Verdict: ACCEPTED

input
864856
view   save

correct output
10111010110110100100101010010
view   save

user output
10100110001101010100110010010
view   save

Test 33

Group: 4

Verdict: ACCEPTED

input
112146
view   save

correct output
1101110101011001100100110
view   save

user output
1010010110001010001010011
view   save

Test 34

Group: 4

Verdict: ACCEPTED

input
741124
view   save

correct output
1011010011010101100101011010
view   save

user output
1010010101100101010011010010
view   save

Test 35

Group: 4

Verdict: ACCEPTED

input
511902
view   save

correct output
1011010100011010100101001110
view   save

user output
1010101110001010110100100110
view   save

Test 36

Group: 4

Verdict: ACCEPTED

input
920019
view   save

correct output
11100100101101010101001101010
view   save

user output
10101010101001011101001100100
view   save

Test 37

Group: 4

Verdict: ACCEPTED

input
933943
view   save

correct output
10101011010100100110100111001
view   save

user output
10101011010100100110100111001
view   save

Test 38

Group: 4

Verdict: ACCEPTED

input
973410
view   save

correct output
1011010101011010101010101001
view   save

user output
1011010101011010101010101001
view   save

Test 39

Group: 4

Verdict: ACCEPTED

input
954943
view   save

correct output
10110110010011010100100110101
view   save

user output
10101101110010101101001010110
view   save

Test 40

Group: 4

Verdict: ACCEPTED

input
911674
view   save

correct output
1010110010110101010101010110
view   save

user output
1010110010110101010101010110
view   save