CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:anotn
Submission time:2023-11-04 17:33:40 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED37
#2ACCEPTED63
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
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#15ACCEPTED0.00 s1, 2details
#16ACCEPTED0.43 s2details
#17ACCEPTED0.44 s2details
#18ACCEPTED0.66 s2details
#19ACCEPTED0.30 s2details
#20ACCEPTED0.44 s2details
#21ACCEPTED0.35 s2details
#22ACCEPTED0.34 s2details
#23ACCEPTED0.29 s2details
#24ACCEPTED0.39 s2details

Code

#include <iostream>
#include <map>
#include <vector>

using namespace std;

int main(){
    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<int>> hex_grid(n+1, vector<int>(m+1));

    map<pair<int, int>, char> inputs;
    for(int i = 0; i < k; i++){
        int a, b; char c;
        cin >> a >> b >> c;
        if(c == 'H')
            inputs[make_pair(a, b)] = 1;
        else
            inputs[make_pair(a, b)] = -10;
    }

    hex_grid[0][m-1] = 0;
    for(int a = 1; a <= n; a++){
        for(int b = 0; b <= m; b++){
            if(b == 0)
                hex_grid[a][b] = hex_grid[a-1][m];
            else
                hex_grid[a][b] = hex_grid[a][b-1];
            if(inputs.find(make_pair(a, b)) != inputs.end()){
                hex_grid[a][b] += inputs[make_pair(a, b)];
            }
        }
    }

    int minimum = hex_grid[1][1];
    for(int a = 1; a <= n; a++){
        for(int b = 1; b <= m; b++){
            auto left_up = make_pair(a, b);
            int up_temp = 0;

            int counter = 0;
            while(true){
                if((left_up.first <= 0) || (left_up.second <= 0) || (left_up.second + counter > m))
                    break;

                up_temp += (hex_grid[left_up.first][left_up.second + counter] - hex_grid[left_up.first][left_up.second - 1]);
                minimum = min(minimum, up_temp);
                left_up.second -= left_up.first%2;
                left_up.first--;
                counter++;
            }

            auto left_down = make_pair(a, b);
            int down_temp = 0;
            counter = 0;
            while(true){
                if((left_down.first > n) || (left_down.second <= 0) || (left_down.second + counter > m))
                    break;

                down_temp += (hex_grid[left_down.first][left_down.second + counter] - hex_grid[left_down.first][left_down.second - 1]);
                minimum = min(minimum, down_temp);

                left_down.second -= left_down.first%2;
                left_down.first++;
                counter++;
            }
        }
    }
    cout << hex_grid[n][m] - minimum;
}

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: ACCEPTED

input
1 1 1
1 1 H

correct output
0

user output
0

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: ACCEPTED

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

correct output
88

user output
88

Test 16

Group: 2

Verdict: ACCEPTED

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

correct output
-624270

user output
-624270

Test 17

Group: 2

Verdict: ACCEPTED

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

correct output
124020

user output
124020

Test 18

Group: 2

Verdict: ACCEPTED

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

correct output
249999

user output
249999

Test 19

Group: 2

Verdict: ACCEPTED

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

correct output
10126

user output
10126

Test 20

Group: 2

Verdict: ACCEPTED

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

correct output
-104692

user output
-104692

Test 21

Group: 2

Verdict: ACCEPTED

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

correct output
-335853

user output
-335853

Test 22

Group: 2

Verdict: ACCEPTED

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

correct output
-208567

user output
-208567

Test 23

Group: 2

Verdict: ACCEPTED

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

correct output
-57100

user output
-57100

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
-52800

user output
-52800