CSES - Datatähti 2025 alku

Submission details
Task:	Tikut
Sender:	rottis
Submission time:	2024-11-04 08:40:37 +0200
Language:	C++ (C++17)
Status:	READY
Result:	8

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	ACCEPTED	8
#3	RUNTIME ERROR	0
#4	RUNTIME ERROR	0
#5	RUNTIME ERROR	0
#6	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.00 s	1, 3, 4, 5, 6	details
#2	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#3	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#4	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#5	ACCEPTED	0.00 s	2, 5, 6	details
#6	ACCEPTED	0.00 s	2, 5, 6	details
#7	WRONG ANSWER	0.00 s	3, 5, 6	details
#8	WRONG ANSWER	0.00 s	3, 5, 6	details
#9	WRONG ANSWER	0.00 s	3, 5, 6	details
#10	WRONG ANSWER	0.00 s	3, 5, 6	details
#11	WRONG ANSWER	0.00 s	3, 5, 6	details
#12	WRONG ANSWER	0.00 s	4, 5, 6	details
#13	WRONG ANSWER	0.00 s	4, 5, 6	details
#14	WRONG ANSWER	0.00 s	4, 5, 6	details
#15	WRONG ANSWER	0.00 s	4, 5, 6	details
#16	WRONG ANSWER	0.01 s	5, 6	details
#17	WRONG ANSWER	0.00 s	5, 6	details
#18	WRONG ANSWER	0.00 s	5, 6	details
#19	WRONG ANSWER	0.00 s	5, 6	details
#20	WRONG ANSWER	0.07 s	6	details
#21	WRONG ANSWER	0.04 s	6	details
#22	WRONG ANSWER	0.07 s	6	details

Code

#include <iostream>
#include <stdlib.h>
#include <algorithm>    // std::sort

unsigned int n, m;

unsigned int *stick_lengths;


void p1_sol() {
    /* Osatehtävä 1 (7 pistettä)

        1 <= n <= 5
        1 <= m <= 10
        1 <= a_i <= 10 */
    // brute force? numbers are really small
    for (unsigned int k = 1; k <= m; k++) {
        
    }
}

// WORKS
void p2_sol() {
    /* Osatehtävä 2 (8 pistettä)

        1 <= n <= 1000
        1 <= m <= 2000
        1 <= a_i <= 3  */
    unsigned int one_count = 0;
    unsigned int two_count = 0;
    unsigned int three_count = 0;

    unsigned int *solutions = (unsigned int*) malloc(m * sizeof(unsigned int));

    for (unsigned int i = 0; i < n; i++ ) {
        switch (stick_lengths[i]) {
            case 1:
                one_count++;
                break;
            case 2:
                two_count++;
                break;
            case 3:
                three_count++;
                break;
        }
    }

    unsigned int cuts_left = m;
    unsigned int i = 0;
    while (three_count > 0 && cuts_left > 0) {
        three_count--;
        one_count++;
        two_count++;
        if (three_count > 0) {
            solutions[i] = 2;
        } else {
            solutions[i] = 1;
        }
        cuts_left--;
        i++;
    }
    while (two_count > 0 && cuts_left > 0) {
        two_count--;
        one_count += 2;
        if (two_count > 0) {
            solutions[i] = 1;
        } else {
            solutions[i] = 0;
        }
        cuts_left--;
        i++;
    }

    std::cout << solutions[0];
    for (unsigned int j = 1; j < m; j++) {
        std::cout << ' ' << solutions[j];
    }
}

void p3_sol() {
    /* Osatehtävä 3 (12 pistettä)

        1 <= n <= 1000
        1 <= m <= 2
        1 <= a_i <= 1000 */
    
    
    std::cout << "wrong solution";
     // k=1
        
        unsigned int max_len = stick_lengths[n-1];
        unsigned int new_len1 = max_len >> 1;
        unsigned int new_len2 = max_len - new_len1;

        unsigned int max_left_in_arr, min_left_in_arr;
        if (n - 2 >= 0) {
            max_left_in_arr = stick_lengths[n-2];
        } else {
            max_left_in_arr = new_len1;
        }

        if (n > 1) {
            min_left_in_arr = stick_lengths[0];
        } else {
            min_left_in_arr = new_len1;
        }

        unsigned int maximum = std::max(std::max(new_len1, new_len2), max_left_in_arr);
        unsigned int minimum = std::min(std::min(new_len1, new_len2), min_left_in_arr);
        
        std::cout << maximum - minimum;
    
    
    if (m == 2) {
        // k=2
        unsigned int case_1_answer, case_2_answer;
        case_2_answer = -1;

        { // case 1: last is divided into 3 equal parts
            unsigned int max_len = stick_lengths[n-1];
            unsigned int max_len_remainder = max_len % 3;
            unsigned int new_len1 = max_len / 3;
            unsigned int new_len2 = new_len1;
            unsigned int new_len3 = new_len1;
            if (max_len_remainder == 2) {
                new_len3++;
                new_len2++;
            } else if (max_len_remainder == 1) {
                new_len3++;
            } // else div equal!

            unsigned int max_left_in_arr, min_left_in_arr;
            if (n - 2 >= 0) {
                max_left_in_arr = stick_lengths[n-2];
            } else {
                max_left_in_arr = new_len1;
            }

            if (n > 1) {
                min_left_in_arr = stick_lengths[0];
            } else {
                min_left_in_arr = new_len1;
            }

            unsigned int maximum = std::max(
                std::max(
                    std::max(max_left_in_arr, new_len1
                    ), new_len2
                ), new_len3
            );
            unsigned int minimum = std::min(
                std::min(
                    std::min(min_left_in_arr, new_len1
                    ), new_len2
                ), new_len3
            );
            case_1_answer = maximum - minimum;
        }

        if (n >= 2) { // case 2: last is divided into 2 equal parts, second to last is divided into 2 equal parts
            unsigned int max_len = stick_lengths[n-1];
            unsigned int new_len1 = max_len>>1;
            unsigned int new_len2 = max_len - new_len1;

            unsigned int second_max_len = stick_lengths[n-2];
            unsigned int new_len3 = second_max_len>>1;
            unsigned int new_len4 = second_max_len - new_len3;

            unsigned int maximum = std::max(
                std::max(
                    std::max(
                        std::max(
                            stick_lengths[n-2], new_len1
                        ), new_len2
                    ), new_len3
                ), new_len4
            );
            unsigned int minimum = std::min(
                std::min(
                    std::min(
                        std::min(
                            stick_lengths[0], new_len1
                        ), new_len2
                    ), new_len3
                ), new_len4
            );
            case_2_answer = maximum - minimum;
        }
        
        std::cout << ' ' << std::min(case_1_answer, case_2_answer);
    }
}

int main() {
    std::cin >> n >> m;
    stick_lengths = (unsigned int*) malloc((n + m) *sizeof(unsigned int));
    for (unsigned int i = 0; i < n; i++) {
        std::cin >> stick_lengths[i];
    }
    std::sort(stick_lengths, &stick_lengths[n]);
    /*for (int i = 0; i < n; i++) {
        std::cout << stick_lengths[i] << ' ';
    }*/
    
    if (m <= 2) {
        p3_sol();
    } else if (n <= 5) {
        p1_sol();
    } else {
        // p4, p5, p6 don't get points anyway :)
        p2_sol();
    }
    std::cout << std::endl;

    return 0;
}

Test details

Test 1

Group: 1, 3, 4, 5, 6

Verdict: RUNTIME ERROR

input
`1 1 6` view save

correct output
`0` view save

user output
(empty)

Test 2

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

input
`5 10 4 8 6 2 7` view save

correct output
`5 4 2 2 2 1 1 1 1 1` view save

user output
(empty)

Test 3

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

input
`5 10 5 5 8 6 7` view save

correct output
`3 3 2 3 2 2 1 1 1 2` view save

user output
(empty)

Test 4

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

input
`5 10 8 7 9 6 10` view save

correct output
`4 4 3 3 2 2 1 2 2 1` view save

user output
(empty)

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

input
`1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Test 6

Group: 2, 5, 6

Verdict: ACCEPTED

input
`1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Test 7

Group: 3, 5, 6

Verdict: WRONG ANSWER

input
`1000 2 15 710 210 347 398 66 318 277 ...` view save

correct output
`994 994` view save

user output
`wrong solution994 994` view save

Test 8

Group: 3, 5, 6

Verdict: WRONG ANSWER

input
`1000 2 743 890 592 942 736 969 616 50...` view save

correct output
`498 496` view save

user output
`wrong solution498 498` view save

Test 9

Group: 3, 5, 6

Verdict: WRONG ANSWER

input
`1000 2 987 968 920 994 988 918 914 95...` view save

correct output
`500 500` view save

user output
`wrong solution500 500` view save

Test 10

Group: 3, 5, 6

Verdict: WRONG ANSWER

input
`1000 2 996 1000 998 998 999 997 997 9...` view save

correct output
`500 500` view save

user output
`wrong solution500 500` view save

Test 11

Group: 3, 5, 6

Verdict: WRONG ANSWER

input
`1000 2 501 501 501 501 501 501 501 50...` view save

correct output
`1 168` view save

user output
`wrong solution1 168` view save

Test 12

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 200 145 136 74 83 73 36 196 115 11...` view save

correct output
`194 190 189 183 182 181 181 17...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 13

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 200 157 110 168 155 192 107 146 15...` view save

correct output
`95 96 96 95 93 94 94 94 90 91 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`50 200 137 118 160 118 146 160 140 18...` view save

correct output
`98 98 98 96 90 91 88 88 84 86 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 200 147 174 186 148 155 128 158 18...` view save

correct output
`99 99 98 98 97 97 96 96 95 95 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 16

Group: 5, 6

Verdict: WRONG ANSWER

input
`1000 2000 928772177 816188227 216592201 ...` view save

correct output
`991676844 990940224 990685481 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 17

Group: 5, 6

Verdict: WRONG ANSWER

input
`1000 2000 665759876 597950008 615453266 ...` view save

correct output
`498801198 498681904 498504321 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

input
`500 2000 683288817 784230412 626685186 ...` view save

correct output
`497667621 498434895 495465990 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

input
`1000 2000 666667000 809309500 571572000 ...` view save

correct output
`499499500 499249250 498999000 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 20

Group: 6

Verdict: WRONG ANSWER

input
`100000 200000 861772559 734298084 983382252 ...` view save

correct output
`499973914 499985299 499985141 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 21

Group: 6

Verdict: WRONG ANSWER

input
`30000 200000 691834579 617419813 514778075 ...` view save

correct output
`499967533 499976270 499969810 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 22

Group: 6

Verdict: WRONG ANSWER

input
`100000 200000 820255000 960780000 741965000 ...` view save

correct output
`499995000 499992500 499990000 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Datatähti 2025 alku

Tikut

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

Tasks

Submissions (rottis)