CSES - Datatähti 2025 alku - Results
Submission details
Task:Tikut
Sender:rottis
Submission time:2024-11-02 21:15:08 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
#60
Test results
testverdicttimegroup
#10.00 s1, 3, 4, 5, 6details
#20.00 s1, 4, 5, 6details
#30.00 s1, 4, 5, 6details
#40.01 s1, 4, 5, 6details
#50.00 s2, 5, 6details
#60.00 s2, 5, 6details
#70.00 s3, 5, 6details
#80.00 s3, 5, 6details
#90.00 s3, 5, 6details
#100.00 s3, 5, 6details
#110.00 s3, 5, 6details
#120.00 s4, 5, 6details
#130.00 s4, 5, 6details
#140.00 s4, 5, 6details
#150.00 s4, 5, 6details
#160.00 s5, 6details
#170.00 s5, 6details
#180.00 s5, 6details
#190.00 s5, 6details
#200.05 s6details
#210.02 s6details
#220.05 s6details

Compiler report

input/code.cpp: In function 'void p3_sol()':
input/code.cpp:26:20: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   26 |         if (c_2max == -1 && cur == c_max) {
      |             ~~~~~~~^~~~~

Code

#include <iostream>
#include <stdlib.h>

unsigned int n, m;

unsigned int *stick_lengths;


void p1_sol() {

}

void p2_sol() {
    
}

void p3_sol() {
    unsigned int c_min = -1;
    unsigned int c_2max = -1; // second highest
    unsigned int c_max = 0;
    for (unsigned int i = 0; i < n; i++) {
        const unsigned int cur = stick_lengths[i];
        if (cur < c_min) {
            c_min = cur;
        }
        if (c_2max == -1 && cur == c_max) {
            c_2max = cur;
        }
        if (cur > c_max) {
            c_2max = c_max;
            c_max = cur;
        }
    }

    bool c_max_odd = c_max & 1;
    unsigned int c_max_half = c_max>>1;
    if (c_max_odd) {
        c_max_half++;
    }
    unsigned int c_real_max = (c_max_half > c_2max ? c_max_half : c_2max);
    if (c_real_max < c_min) {
        std::cout << c_min - c_real_max;
    } else {
        std::cout << c_real_max - c_min;
    }

    if (m == 2) {
        bool c_max_mod_3_has_remainder = c_max % 3;
        unsigned int c_max_div_3 = c_max / 3;

        bool c_2max_odd = c_2max & 1;
        unsigned int c_2max_half = c_2max>>1;

        if (c_max_mod_3_has_remainder) {
            c_max_div_3++;
        }

        if (c_2max_odd) {
            c_2max_half++;
        }

        unsigned int max_case_1 = std::max(c_max_div_3, c_2max);
        unsigned int max_case_2 = std::max(c_max_half, c_2max_half);
        if (c_min > std::min(max_case_1, max_case_2)) {
            std::cout << ' ' << c_min - std::min(max_case_1, max_case_2);
        } else {
            std::cout << ' ' << std::min(max_case_1, max_case_2) - c_min;
        }

    }
}

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];
    }

    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:

input
1 1
6

correct output

user output
3

Test 2

Group: 1, 4, 5, 6

Verdict:

input
5 10
4 8 6 2 7

correct output
5 4 2 2 2 1 1 1 1 1 

user output
(empty)

Test 3

Group: 1, 4, 5, 6

Verdict:

input
5 10
5 5 8 6 7

correct output
3 3 2 3 2 2 1 1 1 2 

user output
(empty)

Test 4

Group: 1, 4, 5, 6

Verdict:

input
5 10
8 7 9 6 10

correct output
4 4 3 3 2 2 1 2 2 1 

user output
(empty)

Test 5

Group: 2, 5, 6

Verdict:

input
1000 1071
3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...

correct output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

user output
(empty)

Test 6

Group: 2, 5, 6

Verdict:

input
1000 1500
3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...

correct output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

user output
(empty)

Test 7

Group: 3, 5, 6

Verdict:

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

correct output
994 994 

user output
994 496

Test 8

Group: 3, 5, 6

Verdict:

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

correct output
498 496 

user output
496 1

Test 9

Group: 3, 5, 6

Verdict:

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

correct output
500 500 

user output
99 400

Test 10

Group: 3, 5, 6

Verdict:

input
1000 2
996 1000 998 998 999 997 997 9...

correct output
500 500 

user output
1 495

Test 11

Group: 3, 5, 6

Verdict:

input
1000 2
501 501 501 501 501 501 501 50...

correct output
1 168 

user output
0 1

Test 12

Group: 4, 5, 6

Verdict:

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

correct output
194 190 189 183 182 181 181 17...

user output
(empty)

Test 13

Group: 4, 5, 6

Verdict:

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

correct output
95 96 96 95 93 94 94 94 90 91 ...

user output
(empty)

Test 14

Group: 4, 5, 6

Verdict:

input
50 200
137 118 160 118 146 160 140 18...

correct output
98 98 98 96 90 91 88 88 84 86 ...

user output
(empty)

Test 15

Group: 4, 5, 6

Verdict:

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

correct output
99 99 98 98 97 97 96 96 95 95 ...

user output
(empty)

Test 16

Group: 5, 6

Verdict:

input
1000 2000
928772177 816188227 216592201 ...

correct output
991676844 990940224 990685481 ...

user output
(empty)

Test 17

Group: 5, 6

Verdict:

input
1000 2000
665759876 597950008 615453266 ...

correct output
498801198 498681904 498504321 ...

user output
(empty)

Test 18

Group: 5, 6

Verdict:

input
500 2000
683288817 784230412 626685186 ...

correct output
497667621 498434895 495465990 ...

user output
(empty)

Test 19

Group: 5, 6

Verdict:

input
1000 2000
666667000 809309500 571572000 ...

correct output
499499500 499249250 498999000 ...

user output
(empty)

Test 20

Group: 6

Verdict:

input
100000 200000
861772559 734298084 983382252 ...

correct output
499973914 499985299 499985141 ...

user output
(empty)

Test 21

Group: 6

Verdict:

input
30000 200000
691834579 617419813 514778075 ...

correct output
499967533 499976270 499969810 ...

user output
(empty)

Test 22

Group: 6

Verdict:

input
100000 200000
820255000 960780000 741965000 ...

correct output
499995000 499992500 499990000 ...

user output
(empty)