CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:anotn
Submission time:2023-11-02 15:43:54 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#40.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#80.00 s1, 2details
#9ACCEPTED0.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
#160.26 s2details
#170.26 s2details
#18ACCEPTED0.42 s2details
#190.13 s2details
#200.26 s2details
#210.18 s2details
#220.18 s2details
#230.12 s2details
#240.21 s2details

Code

#include <iostream>
#include <map>
#include <set>
using namespace std;

map<pair<int, int>, char> hex_grid;

int check(int& val, const pair<int, int>& pair){
    if(hex_grid[pair] == 'K')
        val += 10;
    else if(hex_grid[pair] == 'H')
        val--;
    return 1;
}

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

    set<pair<int, int>> coords;
    for(int y = 1; y <= n; y++){
        for(int x = 1; x <= m; x++){
            hex_grid[make_pair(y, x)] = 'T';
            //coords.insert(make_pair(x, y));
        }
    }

    coords.insert(make_pair(5, 5));
    int total = 0;
    for(int i = 0; i < k; i++){
        int y, x;
        char c;
        cin >> y >> x >> c;

        if(c == 'H')
            total++;
        else
            total -= 10;
        hex_grid[make_pair(y, x)] = c;
;    }

    int largest = 0;
    for(auto it = coords.begin(); it != coords.end(); it++){
        int temp = 0;
        check(temp, *it);
        auto left = make_pair((it -> first) + 1, (it -> second) - (it -> first)%2);
        auto right = make_pair(it -> first + 1, (it -> second) + (it -> first + 1)%2);

        
        while((hex_grid.find(left) != hex_grid.end()) && (hex_grid.find(right) != hex_grid.end())){
            auto move = left;
            while(move.second <= right.second){
                check(temp, move);
                move = make_pair(move.first, move.second + 1);
            }

            left = make_pair((left.first) + 1, (left.second) - (left.first)%2);
            right = make_pair((right.first) + 1, (right.second) + (right.first + 1)%2);
        }
        largest = max(largest, temp);


        temp = 0;
        check(temp, *it);
        left = make_pair((it -> first) - 1, (it -> second) - (it -> first)%2);
        right = make_pair(it -> first - 1, (it -> second) + (it -> first + 1)%2);
        
        while((hex_grid.find(left) != hex_grid.end()) && (hex_grid.find(right) != hex_grid.end())){
            auto move = left;
            while(move.second <= right.second){
                check(temp, move);
                move = make_pair(move.first, move.second + 1);
            }

            left = make_pair((left.first) - 1, (left.second) - (left.first)%2);
            right = make_pair((right.first) - 1, (right.second) + (right.first + 1)%2);
        }
        largest = max(largest, temp);
    }

    cout << total + largest;
}

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
-15

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:

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

correct output
50

user output
41

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
30

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
-27

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:

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

correct output
2

user output
-44

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
1 1 0

correct output
0

user output
0

Test 10

Group: 1, 2

Verdict:

input
1 1 1
1 1 K

correct output
0

user output
-10

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:

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

correct output
20

user output
19

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
10

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
-768

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
78

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
-1249820

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
124000

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:

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

correct output
10126

user output
10000

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
-211241

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
-673838

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
-419329

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
-115301

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
-107257