CSES - Datatähti 2024 qualification mirror - Results
Submission details
Task:Uolevin kalansaalis
Sender:phesch
Submission time:2023-11-04 17:14:07 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#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
#110.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#15ACCEPTED0.00 s1, 2details
#160.28 s2details
#170.28 s2details
#180.30 s2details
#190.26 s2details
#200.28 s2details
#210.27 s2details
#220.27 s2details
#230.26 s2details
#240.27 s2details

Code

#include <bits/stdc++.h>

using namespace std;
using ull = uint64_t;
using sll = int64_t;
static const ull inf = UINT64_MAX;
static const sll infs = INT64_MAX;

using vu = vector<ull>;
using pu = pair<ull, ull>;

int vals[499][500][500];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ull n, m, k;
	cin >> n >> m >> k;

	int total = 0;
	for (ull i = 0; i < k; ++i)
	{
		ull a, b;
		char c;
		cin >> a >> b;
		cin.ignore();
		cin >> c;
		vals[0][a-1][b-1] = c == 'H' ? 1 : -10;
		total += vals[0][a-1][b-1];
	}

	int mini = 0;
	for (ull i = 0; i < n; ++i)
	{
		for (ull j = 0; j < m; ++j)
		{
			mini = min(mini, vals[0][i][j]);
		}
	}

	ull shorter = min(n, m);
	ull mod = 0;
	for (ull t = 1; t < shorter; ++t)
	{
		mod = t % 2;
		for (ull i = t; i < n; ++i)
		{
			ull shift = t / 2 + mod * (i % 2);
			for (ull j = 0; j < m - t; ++j)
			{
				if (t == 1)
				{
					vals[t][i][j] = vals[t-1][i][j] + vals[t-1][i][j+1] + vals[t-1][i-1][j+shift];
				}
				else
				{
					vals[t][i][j] = vals[t-1][i][j] + vals[t-1][i][j+1] + vals[0][i-t][j+shift]
						- vals[t-2][i][j+1];
				}
				mini = min(mini, vals[t][i][j]);
				//cout << t << " " << i << " " << j << " " << vals[t][i][j] << endl;
			}
		}
	}

	for (ull t = 1; t < shorter; ++t)
	{
		mod = t % 2;
		for (ull i = 0; i < n - t; ++i)
		{
			ull shift = t / 2 + mod * (i % 2);
			for (ull j = 0; j < m - t; ++j)
			{
				if (t == 1)
				{
					vals[t][i][j] = vals[t-1][i][j] + vals[t-1][i][j+1] + vals[t-1][i+1][j+shift];
				}
				else
				{
					vals[t][i][j] = vals[t-1][i][j] + vals[t-1][i][j+1] + vals[0][i+t][j+shift]
						- vals[t-2][i][j+1];
				}
				mini = min(mini, vals[t][i][j]);
				//cout << t << " " << i << " " << j << " " << vals[t][i][j] << endl;
			}
		}
	}

	cout << total - mini << 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:

input
1 1 1
1 1 H

correct output
0

user output
1

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)