CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:qanpi
Submission time:2023-11-05 19:13:32 +0200
Language:C++ (C++20)
Status:READY
Result:37
Feedback
groupverdictscore
#1ACCEPTED37
#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
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#15ACCEPTED0.00 s1, 2details
#160.78 s2details
#170.78 s2details
#180.85 s2details
#190.74 s2details
#200.78 s2details
#210.76 s2details
#220.76 s2details
#230.73 s2details
#240.77 s2details

Code

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
 
constexpr ll M = 1000000007;
constexpr ll P = (1 << 18);
constexpr int INF = 1e9;

bool pike[510][510];
bool shrimp[510][510];

long long int triangles[510][510][510];
int left_diagonals[1010][510]; 
int right_diagonals[1010][510]; 

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

	int total = 0;
	for (int i=0; i<k; i++) {
		int a, b;
		char c;
		cin >> a >> b >> c;

		if (c == 'H') {
			total++;
			pike[a][b] = 1;
		} else {
			total -= 10;
			shrimp[a][b] = 1;
		}
	}

	for (int i=1; i<=m+n; i++) {
		for (int j=1; j<=n; j++) {
			int x = -j+1+i-1 + 1 + floor((j-1)/2);
			if (x >= 1 && x <= 500) 
				left_diagonals[i][j] = left_diagonals[i][j-1] - pike[j][x] + 10 * shrimp[j][x];

			int x2 = j-1 + i-1 - (n-1) + 3 - floor(j/2);
			//cout << i << " " << j << " " << x2 << endl;
			if (x2 >= 1 && x2 <= 500) 
				right_diagonals[i][j] = right_diagonals[i][j-1] - pike[j][x2] + 10 * shrimp[j][x2];
		}	
	}

	long long int ans = -INF;
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=m; j++) {
			int max_h_down = n - i + 1;
			int max_h_up = i;
			int max_w = m - j + 1;

			int max_down = min(max_w, max_h_down);
			int max_up = min(max_w, max_h_up);

			//for each triangle size
			for (int t=1; t<=max_down; t++) {
				int dx = i-1+j-1+t-1 + 1 - floor((i-1)/2);
				//if (i%2 && i!=1) dx--;
				int d1 = i+t-1, d2= i-1;
				int diagonal = left_diagonals[dx][d1] - left_diagonals[dx][d2];

				//cout << dx << " " << d1 << " " << d2 << endl;

				triangles[i][j][t] = triangles[i][j][t-1] + diagonal; 

				//cout << i << " " << j << " " << t << " " << triangles[i][j][t] << " " << diagonal << endl;
				ans = max(ans, triangles[i][j][t]);
			}

			for (int t=2; t<=max_up; t++) {
				int dx = -i+1 + j-1 + t-1 + (n-1) + floor((i-2)/2);
				//if (i%2 == 0 && i != 2) dx++;

				int d1 = i, d2= i-t+1-1;

				int diagonal = right_diagonals[dx][d1] - right_diagonals[dx][d2];

				//cout << dx << " " << d1 << " " << d2 << endl;

				triangles[i][j][t] = triangles[i][j][t-1] + diagonal; 

				//cout << i << " " << j << " " << t << " " << triangles[i][j][t] << " " << diagonal << endl;
				ans = max(ans, triangles[i][j][t]);
			}
		}
	}

	cout << total + ans << endl;
}

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:

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)