CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:chaotic
Submission time:2023-11-08 19:28:42 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#110.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#150.00 s1, 2details
#16--2details
#17--2details
#18--2details
#19--2details
#20--2details
#21--2details
#22--2details
#23--2details
#24--2details

Code

#include <algorithm>
#include <cassert>
#include <iostream>
#include <limits>
#include <sstream>
#include <vector>

template<class T> struct array2d {
    std::vector<T> data;
    size_t rows;
    size_t cols;

    constexpr array2d(size_t rows_, size_t cols_)
        : data(rows_ * cols_, 0), rows(rows_), cols(cols_) {}

    constexpr T& operator()(size_t row, size_t col) {
        assert(row < rows);
        assert(col < cols);
        return data[row + col * rows];
    }
    constexpr T const& operator()(size_t row, size_t col) const {
        assert(row < rows);
        assert(col < cols);
        return data[row + col * rows];
    }
};

// Calculate sum in range [first, first + count)
int sum_between(auto const& arr, size_t row, size_t first, size_t count) {
    return arr(row, first + count) - arr(row, first);
}

int do_search(int sum_of_all, size_t rows, size_t cols, auto const& running_sum) {
    int result                    = sum_of_all;
    size_t const biggest_triangle = std::min(rows, cols);

    // For every cell
    for (size_t row = 0; row < rows; ++row) {
        for (size_t col = 0; col < cols; ++col) {

            // For every size of triangles
            for (size_t T = 1; T <= biggest_triangle; ++T) {
                if (!(row + T <= rows)) break;
                if (!(col + T <= cols)) break;

                int sum = 0;

                // Count every row
                size_t first_col = col;
                assert(first_col <= cols);
                for (size_t T_row = 0; T_row < T; ++T_row) {
                    sum += sum_between(running_sum, row + T_row, first_col, T - T_row);
                    if ((row + T_row) % 2 == 1) ++first_col;
                }
                result = std::max(sum_of_all - sum, result);
            }
        }
    }

    return result;
}

int main() {
    //    std::stringstream input(R"(5 6 13
    // 1 1 K
    // 5 1 K
    // 2 2 H
    // 4 2 H
    // 5 2 H
    // 2 6 K
    // 3 3 H
    // 3 4 K
    // 3 5 H
    // 3 6 K
    // 4 4 K
    // 2 5 H
    // 5 5 H)");
    //    std::stringstream input(R"(
    // 2 2 3
    // 1 2 K
    // 2 1 K
    // 2 2 K
    // 1 1 K
    //)");
    auto& input = std::cin;

    size_t rows, cols, k;
    input >> rows >> cols >> k;

    array2d<int> values(rows, cols);

    for (size_t i = 0; i < k; ++i) {
        size_t x, y;
        char ch;
        input >> x >> y >> ch;
        values(x - 1, y - 1) = ch == 'K' ? -10 : 1;
    }

    array2d<int> running_sum(rows, cols + 1);
    int sum_of_all = 0;

    // First column always 0
    for (size_t i = 0; i < rows; ++i) {
        size_t sum = 0;
        for (size_t j = 0; j < cols; ++j) {
            sum                   += values(i, j);
            running_sum(i, j + 1)  = sum;
        }
        sum_of_all += sum;
    }

    int result = std::numeric_limits<int>::min();

    result = std::max(result, do_search(sum_of_all, rows, cols, running_sum));

    //    Revrse each column
    for (size_t i = 0; i < cols + 1; ++i) {
        std::reverse(&running_sum(0, i), &running_sum(rows - 1, i) + 1);
    }

    result = std::max(result, do_search(sum_of_all, rows, cols, running_sum));

    std::cout << result << "\n";
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
5 6 13
1 1 K
5 1 K
2 2 H
4 2 H
...

correct output
-16

user output
-16

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
5 6 7
1 5 K
4 6 K
2 4 H
2 5 H
...

correct output
0

user output
0

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
5 6 7
5 5 K
2 6 K
2 4 H
2 5 H
...

correct output
0

user output
0

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
10 10 51
3 3 H
6 3 H
9 5 H
5 10 H
...

correct output
50

user output
50

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
10 10 52
3 5 H
3 1 H
9 6 H
2 8 H
...

correct output
40

user output
40

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
10 10 60
6 10 H
2 8 H
5 8 H
8 10 H
...

correct output
-15

user output
-15

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
10 10 60
4 7 H
7 4 H
4 10 H
3 6 H
...

correct output
60

user output
60

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
10 10 40
9 9 H
5 10 H
5 6 H
4 9 H
...

correct output
2

user output
2

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
1 1 0

correct output
0

user output
0

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
1 1 1
1 1 K

correct output
0

user output
0

Test 11

Group: 1, 2

Verdict:

input
1 1 1
1 1 H

correct output
0

user output
1

Test 12

Group: 1, 2

Verdict: ACCEPTED

input
10 5 32
10 3 H
4 4 H
3 3 H
5 4 H
...

correct output
20

user output
20

Test 13

Group: 1, 2

Verdict: ACCEPTED

input
5 10 32
5 9 H
2 4 H
2 9 H
2 5 H
...

correct output
28

user output
28

Test 14

Group: 1, 2

Verdict: ACCEPTED

input
10 10 100
2 9 H
5 4 H
5 9 K
6 1 K
...

correct output
-439

user output
-439

Test 15

Group: 1, 2

Verdict:

input
10 10 100
8 9 H
5 10 H
5 4 H
3 9 H
...

correct output
88

user output
90

Test 16

Group: 2

Verdict:

input
500 500 125000
125 261 K
84 78 K
11 200 K
481 246 K
...

correct output
-624270

user output
(empty)

Test 17

Group: 2

Verdict:

input
500 500 125100
16 61 H
37 62 H
459 125 H
318 476 H
...

correct output
124020

user output
(empty)

Test 18

Group: 2

Verdict:

input
500 500 249999
22 214 H
356 145 H
341 29 H
393 262 H
...

correct output
249999

user output
(empty)

Test 19

Group: 2

Verdict:

input
500 500 32000
30 81 H
315 34 H
78 112 H
367 166 H
...

correct output
10126

user output
(empty)

Test 20

Group: 2

Verdict:

input
500 500 126745
164 390 H
126 331 H
164 126 H
55 92 H
...

correct output
-104692

user output
(empty)

Test 21

Group: 2

Verdict:

input
500 500 71200
106 191 H
314 189 H
482 485 H
344 401 H
...

correct output
-335853

user output
(empty)

Test 22

Group: 2

Verdict:

input
500 500 67772
421 277 H
428 470 H
169 142 H
256 345 H
...

correct output
-208567

user output
(empty)

Test 23

Group: 2

Verdict:

input
500 500 27434
366 481 H
38 22 H
126 107 H
135 169 H
...

correct output
-57100

user output
(empty)

Test 24

Group: 2

Verdict:

input
500 500 93982
183 13 H
463 230 H
264 351 H
399 290 H
...

correct output
-52800

user output
(empty)