CSES - Datatähti 2024 qualification mirror - Results
Submission details
Task:Uolevin kalansaalis
Sender:martinm17
Submission time:2023-11-02 01:06:24 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#80.00 s1, 2details
#90.00 s1, 2details
#100.00 s1, 2details
#110.00 s1, 2details
#120.00 s1, 2details
#130.00 s1, 2details
#140.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 <iostream>
#include <vector>

using namespace std;

int triangleScan(std::vector<std::vector<int>> &grid, int t)
{
    int n = grid.size();
    int m = grid[0].size();
    std::vector<std::vector<std::vector<int>>> dp(n, std::vector<std::vector<int>>(m, std::vector<int>(t + 1, 1000000)));

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            dp[i][j][1] = grid[i][j];
        }
    }

    for (int k = 2; k <= t; ++k)
    {
        for (int i = k - 1; i < n; ++i)
        {
            for (int j = k - 1; j < m; ++j)
            {
                for (int x = 0; x < k; ++x)
                {
                    dp[i][j][k] = std::min(dp[i][j][k], dp[i - 1][j - 1][k - 1] + grid[i - x][j] + grid[i][j - x]);
                }
            }
        }
    }

    int min_sum = 1000000;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            min_sum = std::min(min_sum, dp[i][j][t]);
        }
    }

    return min_sum;
}

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    // create a weight list for cell in the table of dimension n*m
    vector<vector<int>> adj(n, vector<int>(m, 0));
    int total_points = 0;
    for (int i = 0; i < k; i++)
    {
        int a, b;
        char c;
        cin >> a >> b >> c;
        if (c == 'K')
        {
            adj[a - 1][b - 1] = -10;
            total_points -= 10;
        }
        else if (c == 'H')
        {
            adj[a - 1][b - 1] = 1;
            total_points += 1;
        }
        else
        {
            cout << "Invalid input" << endl;
            return 0;
        }
    }
    int size = min(n, m);
    int minSum = 1000000;
    for (int i = size; i > 0; i--)
    {
        minSum = min(minSum, triangleScan(adj, i));
    }
    cout << total_points - (minSum + 3) << endl;

    return 0;
}

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:

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

correct output
0

user output
12

Test 3

Group: 1, 2

Verdict:

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

correct output
0

user output
2

Test 4

Group: 1, 2

Verdict:

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

correct output
50

user output
56

Test 5

Group: 1, 2

Verdict:

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

correct output
40

user output
47

Test 6

Group: 1, 2

Verdict:

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

correct output
-15

user output
34

Test 7

Group: 1, 2

Verdict:

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

correct output
60

user output
57

Test 8

Group: 1, 2

Verdict:

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

correct output
2

user output
18

Test 9

Group: 1, 2

Verdict:

input
1 1 0

correct output
0

user output
-3

Test 10

Group: 1, 2

Verdict:

input
1 1 1
1 1 K

correct output
0

user output
-3

Test 11

Group: 1, 2

Verdict:

input
1 1 1
1 1 H

correct output
0

user output
-3

Test 12

Group: 1, 2

Verdict:

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

correct output
20

user output
26

Test 13

Group: 1, 2

Verdict:

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

correct output
28

user output
37

Test 14

Group: 1, 2

Verdict:

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

correct output
-439

user output
-791

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
101

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)