CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:kasvoton
Submission time:2023-11-09 19:28:22 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.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
#10ACCEPTED0.00 s1, 2details
#110.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#130.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#150.00 s1, 2details
#16ACCEPTED0.08 s2details
#170.07 s2details
#18--2details
#190.02 s2details
#20ACCEPTED0.07 s2details
#210.04 s2details
#220.04 s2details
#230.02 s2details
#240.06 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:66:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::array<int, 5> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for (int i = 0; i < q.size();) {
      |                         ~~^~~~~~~~~~

Code

#include <iostream>
#include <array>
#include <deque>

using namespace std;

int s[500][501];
int p = 1000000;
int f(int y, int x, int d, int t);

int main() {
	int n, m, k;
	cin >> n >> m >> k;
	if (!k) {
		cout << "0\n";
		return 0;
	}
	int a[n][m];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) a[i][j] = 0;
	}
	int b = 0;
	for (int i = 0; i < k; i++) {
		int y, x;
		char z;
		cin >> y >> x >> z;
		if (z == 'H') {
			a[y-1][x-1] = 1;
			b++;
		}
		else {
			a[y-1][x-1] = -10;
			b -= 10;
		}
	}
	for (int i = 0; i < n; i++) {
		s[i][0] = 0;
		for (int j = 1; j < m+1; j++) s[i][j] = s[i][j-1] + a[i][j-1];
	}

	int t;
	if (n <= m) t = n;
	else t = m;

	deque<array<int, 5>> q;

	if (n < 2 * m - (n & 1)) {
		for (int i = t-1; i > n/2; i--) {
			int x;
			if ((n-i)&1) x = m - i;
			else x = 0;
			q.emplace_back((array<int, 5>){1000000, n-i, x, 1, i});
			if ((i-1)&1) x = m - i;
			else x = 0;
			q.emplace_back((array<int, 5>){1000000, i-1, x, 0, i});
		}
	}

	for (int i = 0; i < n-t+1; i++) {
		for (int j = 0; j < m-t+1; j++) {
			q.emplace_back((array<int, 5>){1000000, i, j, 1, t});
			q.emplace_back((array<int, 5>){1000000, n-i-1, j, 0, t});
		}
	}

	for (int i = 0; i < q.size();) {
		if (q[0][0] == 1000000) q[0][0] = f(q[0][1], q[0][2], q[0][3], q[0][4]);
		if (q[0][0] < p) p = q[0][0];
		if (q[0][0] == p) {
			q.push_back(q.front());
			i++;
		}
		else i = 0;
		q.pop_front();
	}

	while (!q.empty()) {
		array<int, 5> r = q.front();
		r[4]--;
		int v = f(r[1], r[2], r[3], r[4]);
		if (v < p) p = v;
		if (v == p && r[4] > 1) q.push_back(r);
		r[2]++;
		v = f(r[1], r[2], r[3], r[4]);
		if (v < p) p = v;
		if (v == p && r[4] > 1) q.push_back(r);
		r[2] -= 1 - (r[1] & 1);
		if (r[3]) r[1]++;
		else r[1]--;
		v = f(r[1], r[2], r[3], r[4]);
		if (v < p) p = v;
		if (v == p && r[4] > 1) q.push_back(r);
		q.pop_front();
	}

	cout << b - p << "\n";

	return 0;
}

int f(int y, int x, int d, int t) {
	int v = 0, z = x;
	if (d) {
		for (int i = y, w = t; w > 0; i++, w--, z = x+(i-y+1)/2)
			v += s[i][z+w] - s[i][z];
	}
	else {
		for (int i = y, w = t; w > 0; i--, w--, z = x+(y-i+1)/2)
			v += s[i][z+w] - s[i][z];
	}

	return v;
}

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:

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

correct output
50

user output
40

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

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
12

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:

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

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

correct output
88

user output
85

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:

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:

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
9061

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:

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

correct output
-335853

user output
-335820

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

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

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