CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:Emunemu
Submission time:2023-10-31 20:42:19 +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
#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
#130.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#150.00 s1, 2details
#160.73 s2details
#170.72 s2details
#180.80 s2details
#190.67 s2details
#200.72 s2details
#210.69 s2details
#220.69 s2details
#230.67 s2details
#240.70 s2details

Code

#include <bits/stdc++.h>

using namespace std;
using ll=long long;

int size;
int maxim=2;
int bp[501][501];

int sum(int a, int k) {
    if (k==0) {
        return 0;
    }
    int s=0;
    while (k>=1) {
        s+=bp[a][k];
        k-=k&-k;
    }
    return s;
}

void add(int a, int k, int x) {
    while (k<=size) {
        bp[a][k]+=x;
        k+=k&-k;
    }
}

int main()
{
    int startsituation=0;
    int n, m, k;
    cin >> n >> m >> k;
    size=m;
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            bp[n][m]=0;
        }
    }
    
    for (int i=0; i<k; i++) {
        int a, b;
        char c;
        cin >> a >> b >> c;
        if (c=='H') {
            startsituation+=1;
            add(a, b, 1);
        } else {
            startsituation-=10;
            add(a, b, -10);
        }
    }
    
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            int snow=0;
            int leftlim=j;
            int depth=1;
            for (int l=i; l<=n; l++) {
                if (leftlim==0 or leftlim+(l-1)>m) {
                    break;
                }
                int to_add=sum(depth,leftlim+(l-1))-sum(depth,leftlim-1);
                snow+=to_add;
                
                maxim=min(snow, maxim);
                
                
                if (l%2==1) {
                    leftlim--;
                }
                depth++;
                
            }
        }
    }
    
    for (int i=n; i>=1; i--) {
        for (int j=1; j<=m; j++) {
            int snow=0;
            int leftlim=j;
            int depth=n;
            for (int l=(n-i)+1; l<=n; l++) {
                if (leftlim==0 or leftlim+(l-1)>m) {
                    break;
                }
                int to_add=sum(depth,leftlim+(l-1))-sum(depth,leftlim-1);
                snow+=to_add;
                
                maxim=min(snow, maxim);
                
                
                if (l%2==1) {
                    leftlim--;
                }
                depth--;
                
            }
        }
    }
    
    
    
    int ans=startsituation-maxim;
    
    cout << ans;
}


/*for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            cout << bp[i][j] << " ";
        }
        cout << "\n";
    }
*/

/*if (snow<maxim) {
                    cout << i << " " << j << "\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:

input
10 10 60
6 10 H
2 8 H
5 8 H
8 10 H
...

correct output
-15

user output
-12

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
16

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
19

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
26

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
83

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

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
124010

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
249998

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
10096

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

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

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

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