CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:perusjuntti
Submission time:2023-11-03 22:41:51 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#60.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#80.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#130.00 s1, 2details
#140.00 s1, 2details
#15ACCEPTED0.01 s1, 2details
#160.41 s2details
#170.42 s2details
#18ACCEPTED0.48 s2details
#190.37 s2details
#200.41 s2details
#210.39 s2details
#220.39 s2details
#230.37 s2details
#240.40 s2details

Code

#include <bits/stdc++.h>
using namespace std;
 
const int mxN = 505;
int p[mxN][mxN], a[mxN][mxN], n, m, k, q = -1e9, i, j, y, x, t, r;
char c;
 
bool in_bounds(int lb, int rb, int y) {
    return y > 0 && y <= n && lb > 0 && rb <= m;
}
 
signed main() { 
    cin >> n >> m >> k;
    for (; i < k; ++i) {
        cin >> y >> x >> c;
        a[y][x] = (c == 'K' ? -10 : 1);
        t += a[y][x];
    }
    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= m; ++j) {
            p[i][j] = p[i][j-1]+p[i][j];
        }
    }
    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= m; ++j) {
            r = a[i][j];
            q = max(q,t-r);
            int y = i, lb = j, rb = j;
            while (true) {
                y += 1;
                if (y & 1) {
                    rb += 1;
                    if (!in_bounds(lb, rb, y)) {
                        break;
                    }
                    r += p[y][rb]-p[y][lb-1];
                }
                else {
                    if (!in_bounds(lb, rb, y)) {
                        break;
                    }
                    lb -= 1;
                    r += p[y][rb]-p[y][lb-1];
                }
                q = max(q,t-r);
            }
            q = max(q,t-r);
        }
    }
    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= m; ++j) {
            r = a[i][j];
            q = max(q,t-r);
            int y = i, lb = j, rb = j;
            while (true) {
                y -= 1;
                if (y & 1) {
                    rb += 1;
                    if (!in_bounds(lb, rb, y)) {
                        break;
                    }
                    r += p[y][rb]-p[y][lb-1];
                }
                else {
                    if (!in_bounds(lb, rb, y)) {
                        break;
                    }
                    lb -= 1;
                    r += p[y][rb]-p[y][lb-1];
                }
                q = max(q,t-r);
            }
            q = max(q,t-r); 
        }
    }
    cout << q;
}

Test details

Test 1

Group: 1, 2

Verdict:

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

correct output
-16

user output
-43

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

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

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:

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

correct output
-15

user output
-40

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

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:

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

correct output
28

user output
20

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

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:

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

correct output
-624270

user output
-1249990

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
124010

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
10010

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

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

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

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

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