Practical2/checkout.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70

#include <stdio.h>
#include <stdint.h>

int8_t round_profit(uint32_t value) {
    switch (value % 5) {
        case 0: return 0;
        case 1: return 1;
        case 2: return 2;
        case 3: return -2;
        case 4: return -1;
    }
}

int32_t maximum_profit(uint16_t products[], uint16_t n_products, uint8_t dividers) {
    int8_t profit[n_products+1][dividers+1];
    uint16_t p, d;
    for (p = 0; p <= n_products; p++) {
        uint32_t sums[p];
        if (p == 0) {
            sums[0] = 0;
        } else {
            sums[p-1] = products[p-1];
            int16_t i;
            for (i = p-2; i >= 0; i--) {
                sums[i] = products[i] + sums[i+1];
            }
        }

        for (d = 0; d <= dividers; d++) {
            if (p == 0) {
                profit[p][d] = 0;
            } else if (d == 0) {
                profit[p][d] = round_profit(sums[0]);
            } else {
                int8_t max = profit[p][d-1];
                uint16_t i;
                for (i = 0; i < p; i++) {
                    int8_t try = profit[i][d-1] + round_profit(sums[i]);
                    if (try > max)
                        max = try;
                }
                profit[p][d] = max;
            }
        }
    }

    return profit[n_products][dividers];
}

int main(void) {
    int n_products;
    int dividers;
    uint32_t sum = 0;

    scanf("%d %d", &n_products, &dividers);

    uint16_t products[n_products];
    uint16_t i;
    for (i = 0; i < n_products; i++) {
        scanf("%d", &(products[i]));
        sum += products[i];
        if (products[i] % 5 == 0) {
            n_products--;
            i--;
        }
    }

    printf("%d\n", sum - maximum_profit(products, n_products, dividers));
}