CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:Tipu
Submission time:2023-11-12 20:19:47 +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
#50.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.00 s1, 2details
#14ACCEPTED0.00 s1, 2details
#150.00 s1, 2details
#16ACCEPTED0.09 s2details
#170.08 s2details
#180.15 s2details
#190.03 s2details
#20ACCEPTED0.09 s2details
#21ACCEPTED0.06 s2details
#22ACCEPTED0.06 s2details
#23ACCEPTED0.03 s2details
#24ACCEPTED0.07 s2details

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;


struct Hex {       
  public:            
    int l = 0;   
    int r = 0;
};

const int SIZE = 501;

int n, m, k;
int v[SIZE][SIZE];
int v2[SIZE][SIZE];
Hex d[SIZE][SIZE];

int count_l_colum(int i, int j, int l){
    bool add = (i % 2 == 0);
    return (d[i][j].l - d[i-l][j - int(ceil((l-add)/2.0))].l);
} 

int count_r_colum(int i, int j, int l){
    bool add = (i % 2 == 0);
    return (d[i][j].r - d[i-l][j + int((l+add)/2.0)].r);
} 

int scan(int p, bool skip1){

    for (int i = n; i >= 1; i--) {
        if(skip1 && i == 1){
            break;
        }
        int h = i-skip1;

        int j2 = 1;
        int j1 = 1;

        int l = 1;

        int ms = d[i][1].l - d[i-1][(i % 2 == 0)].l; 
        int s = ms;

        int safety = 0;
        while (j1 < m)
        {
            safety++;
            p = min(s, p);
            if(j2 < j1+h - 1 && j2 < m){
                j2++;
                ms += count_l_colum(i, j2, (j2-j1 + 1));
                continue;
            }

            //else
            if((ms - s) < 0){
                l++;
                s += count_l_colum(i, (j1+l-1), l);
                continue;
            }

            //else
            if((ms - s) >= 0 && j1 < j2 && l > 1){
                s -= count_r_colum(i, j1, l);
                ms -= count_r_colum(i, j1, (j2-j1 + 1));
                j1++;
                l--;
                continue;
            }
            else
            {
                s -= count_r_colum(i, j1, l);
                ms -= count_r_colum(i, j1, (j2-j1 + 1));
                j1++;

                j2++;
                s += count_l_colum(i, (j1+l-1), l);
                ms += count_l_colum(i, j2, (j2-j1 + 1));
                continue;
            }
        }
        p = min(s, p);


        
      

    }     
    return p;   
}


int main() {
    // freopen("input.txt", "r", stdin);



    cin >> n >> m >> k;

    int a, b;
    char c;
    for (int i = 0; i < k; i++) {
        cin >> a >> b >> c;
        if(c == 'H'){
            v[a][b] = 1;
        }else{
            v[a][b] = -10;
        }
    }
    int os = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            bool add = 0;
            if(i % 2 == 0){
                add = 1;
            }
            os += v[i][j];
            d[i][j].l = v[i][j] + d[i-1][j-1+add].l;
            d[i][j].r = v[i][j] + d[i-1][j+add].r;
        }
    }

    // for (int i = 1; i <= n; i++) {
    //     for (int j = 1; j <= m; j++) {
    //         cout << "(" << d[i][j].l << " ; " << d[i][j].r << ")  " ;
    //     }
    //     cout << "\n";
    // }

    int p = 1e6;
    p = scan(p,false);

    // cout << p << endl;
    // cout << os << endl;
    // assert(p >= os);
    // cout << "\n\n";
    bool fix = (n%2 == 0);
    n += fix;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if(v[i][j] != 0){
                v2[n+1-i][j] = v[i][j];
            }
        }
    }


    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            bool add = 0;
            if(i % 2 == 0){
                add = 1;
            }
            d[i][j].l = v2[i][j] + d[i-1][j-1+add].l;
            d[i][j].r = v2[i][j] + d[i-1][j+add].r;
        }
    }
    
    // for (int i = 1; i <= n; i++) {
    //     for (int j = 1; j <= m; j++) {
    //         cout << "(" << d[i][j].l << " ; " << d[i][j].r << ")  " ;
    //     }
    //     cout << "\n";
    // }

    p = min(scan(p, fix), p);

    // assert((n <= 5 && m <= 5));
    cout << os - p;

}

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:

input
10 10 52
3 5 H
3 1 H
9 6 H
2 8 H
...

correct output
40

user output
51

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:

input
10 10 60
4 7 H
7 4 H
4 10 H
3 6 H
...

correct output
60

user output
73

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:

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

correct output
88

user output
101

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
145257

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
291914

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