| Task: | Uolevin kalansaalis |
| Sender: | a256 |
| Submission time: | 2023-10-30 01:26:14 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 37 |
| #2 | ACCEPTED | 63 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2 | details |
| #7 | ACCEPTED | 0.00 s | 1, 2 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2 | details |
| #9 | ACCEPTED | 0.00 s | 1, 2 | details |
| #10 | ACCEPTED | 0.00 s | 1, 2 | details |
| #11 | ACCEPTED | 0.00 s | 1, 2 | details |
| #12 | ACCEPTED | 0.00 s | 1, 2 | details |
| #13 | ACCEPTED | 0.00 s | 1, 2 | details |
| #14 | ACCEPTED | 0.00 s | 1, 2 | details |
| #15 | ACCEPTED | 0.00 s | 1, 2 | details |
| #16 | ACCEPTED | 0.38 s | 2 | details |
| #17 | ACCEPTED | 0.38 s | 2 | details |
| #18 | ACCEPTED | 0.40 s | 2 | details |
| #19 | ACCEPTED | 0.36 s | 2 | details |
| #20 | ACCEPTED | 0.38 s | 2 | details |
| #21 | ACCEPTED | 0.38 s | 2 | details |
| #22 | ACCEPTED | 0.37 s | 2 | details |
| #23 | ACCEPTED | 0.37 s | 2 | details |
| #24 | ACCEPTED | 0.38 s | 2 | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 555
// hauki 1
// katkarapu -10
ll t[N][N],L[N][N],R[N][N],n,m,k,a,b,r=1,S;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m>>k;
for(int i=0;i<k;++i){
char T;
cin>>a>>b>>T;
if(T=='H') ++t[a][b];
else t[a][b]-=10;
}
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
S+=t[i][j];
if(~i&1){ // p
L[i][j]=L[i-1][j]+t[i][j];
R[i][j]=R[i-1][j+1]+t[i][j];
} else {
L[i][j]=L[i-1][j-1]+t[i][j];
R[i][j]=R[i-1][j]+t[i][j];
}
}
}
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
ll A,Y;
A=Y=t[i][j];
r=min(A,r);
r=min(Y,r);
int ay=i,ax=j,yy=i,yx=j;
for(int k=j+1;k<=m;++k){
if(~ay&1) ++ax;
--ay;
if(~yy&1) ++yx;
++yy;
if(ay>0){
Y+=L[i][k]-L[ay][ax]+t[ay][ax];
r=min(Y,r);
}
if(yy<=n){
A+=R[yy][yx]-R[i][k]+t[i][k];
r=min(A,r);
}
}
}
}
cout<<S-r<<'\n';
}
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: 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: ACCEPTED
| input |
|---|
| 500 500 32000 30 81 H 315 34 H 78 112 H 367 166 H ... |
| correct output |
|---|
| 10126 |
| user output |
|---|
| 10126 |
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: ACCEPTED
| input |
|---|
| 500 500 71200 106 191 H 314 189 H 482 485 H 344 401 H ... |
| correct output |
|---|
| -335853 |
| user output |
|---|
| -335853 |
Test 22
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 500 500 67772 421 277 H 428 470 H 169 142 H 256 345 H ... |
| correct output |
|---|
| -208567 |
| user output |
|---|
| -208567 |
Test 23
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 500 500 27434 366 481 H 38 22 H 126 107 H 135 169 H ... |
| correct output |
|---|
| -57100 |
| user output |
|---|
| -57100 |
Test 24
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 500 500 93982 183 13 H 463 230 H 264 351 H 399 290 H ... |
| correct output |
|---|
| -52800 |
| user output |
|---|
| -52800 |
