CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:Vludo
Submission time:2023-11-07 23:31:59 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.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
#120.00 s1, 2details
#13ACCEPTED0.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#15ACCEPTED0.00 s1, 2details
#16ACCEPTED0.38 s2details
#17ACCEPTED0.39 s2details
#18ACCEPTED0.40 s2details
#190.36 s2details
#20ACCEPTED0.38 s2details
#210.38 s2details
#220.37 s2details
#230.36 s2details
#240.38 s2details

Code

#include <bits/stdc++.h>
 
#define forn(i, n) for(int i=0; i<n; i++)
#define FOR(i, j, n) for(int i=j; i<n; i++)
#define pb push_back
#define F first
#define S second
 
typedef long long ll;
 
const int inf = 1.01e9;
const int mod = 1e9 + 7;
 
using namespace std;
 
int n, m, k, result=0;
int reika;
int arr[502][502], 
	summarr[502][502],
	mem[502][502];
 
void kolmio(int a, int b);
 
int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> n >> m >> k;
	
	int ina, inb;
	char c;
	forn(i, k) {
		cin >> ina >> inb >> c;
		if (c == 'K') arr[ina][inb] = mem[ina][inb] = -10;
		else arr[ina][inb] = mem[ina][inb] = 1;
		result += arr[ina][inb];
	}
	
	FOR (a, 1, n+1) {
		int summa = 0;
		FOR (b, 1, m+1) {
			summa += arr[a][b];
			summarr[a][b] = summa; 
		}
	}	
	
	reika = arr[1][1];
	
	FOR(a, 1, n+1) {
		FOR(b, 1, m+1) {
			kolmio(a, b);
		}
	}
	
	FOR(a, 1, (n+1)/2) {
		FOR(b, 1, m+1) {
			swap(arr[a][b], arr[n-a+1][b]);
			swap(mem[a][b], mem[n-a+1][b]);
			swap(summarr[a][b], summarr[n-a+1][b]);
		}
	}
	
	FOR(a, 1, n+1) {
		FOR(b, 1, m+1) {
			kolmio(a, b);
		}
	}
	
	cout << result - reika << endl;
	
	return 0;
}
 
void kolmio(int a, int b) {
	reika = min(reika, arr[a][b]);
	
	FOR(T, 2, n+1) {
		int summa = mem[a][b];
		
		int lc, rc;
		int h = a + T - 1;
		
		if (T % 2 == 1) {
			lc = b - (T-1)/2;
			rc = b + (T-1)/2;
		} else {
			if (a % 2 == 1) {
				lc = b - T/2;
				rc = b + T/2 - 1;
			} else {
				lc = b - T/2 + 1;
				rc = b + T/2;
			}
		}
	
		if (lc < 1 || rc > m || h > n) return;
		
		int rivisumma = summarr[h][rc] - summarr[h][lc-1];
		summa += rivisumma;
		reika = min(reika, summa);
		
		mem[a][b] = summa;
		// cout << "reika: " << summa << ", (a, b, T): " << a << " " << b << " " << T;
		// cout << ", lc=" << lc << ", rc=" << rc << ", rivisumma=" << rivisumma;
		// cout << ", rivi=" << h << ", ";
		// cout << endl;
	}
	return;
}

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
2

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
1

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

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
13

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:

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

correct output
20

user output
28

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

input
500 500 125100
16 61 H
37 62 H
459 125 H
318 476 H
...

correct output
124020

user output
124020

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
10106

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