CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:cppbetter
Submission time:2023-11-08 19:23:24 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#80.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#110.00 s1, 2details
#120.00 s1, 2details
#130.00 s1, 2details
#140.00 s1, 2details
#150.00 s1, 2details
#160.45 s2details
#170.45 s2details
#180.60 s2details
#190.35 s2details
#200.46 s2details
#21ACCEPTED0.40 s2details
#22ACCEPTED0.39 s2details
#23ACCEPTED0.34 s2details
#24ACCEPTED0.42 s2details

Code

#include <iostream>
#include <vector>
#include <cassert>

//#define TEST
#ifdef TEST
#define PRINTDBG(x) cout << x
#else
#define PRINTDBG(x)
#endif

using namespace std;
using ll = int64_t;

vector<ll> v;
ll n, m;

ll getv(ll x, ll y)
{
    if (x == -1 || y == -1 || x == n || y == m)
        return 0;
#ifdef TEST
    assert(x >= 0 && y >= 0);
    assert(x < n && y < m);
#endif
    return v[x + y * n];
}

void setv(ll x, ll y, ll c)
{
#ifdef TEST
    assert(x >= 0 && y >= 0);
    assert(x < n && y < m);
#endif
    v[x + y * n] = c;
}

int main()
{
#ifndef TEST
    cout.sync_with_stdio(false);
    cin.tie(0);

    int k;
    cin >> m >> n >> k;

    v.resize(m * n, 0);
    ll t = 0;

    for (ll i = 0; i < k; i++)
    {
        ll a, b;
        char c;
        cin >> a >> b >> c;

        ll val;
        if (c == 'H')
            val = -1;
        else
            val = 10;
        t -= val;
       
        for (ll y = a - 1; y < m; y++)
        {
            ll x = b - 1 + (y / 2 - (a - 1)/2);
            if (x == n)
                break;
            setv(x, y, val + getv(x, y));
        }
    }


    ll bt = 0;
    for (ll a = 0; a < n; a++)
        for (ll b = 0; b < m; b++)
        {
            ll sum = getv(a, b) - getv(a - (b + 1) % 2, b - 1);
            bt = max(sum, bt);
            for (ll T = 1; T <= min(m - b - 1, a); T++)
            {
                ll y1 = b - 1;
                ll x1 = a - T - (y1 + (b + 1) % 2) / 2;
                ll y2 = b + T;
                ll x2 = a - (T + (b + 1) % 2) / 2;
                sum += getv(x2, y2) - getv(x1, y1);
                bt = max(sum, bt);
            }
        }
    
    for (ll a = 0; a < n; a++)
        for (ll b = 0; b < m; b++)
        {
            ll sum = getv(a, b) - getv(a - (b + 1) % 2, b - 1);
            bt = max(sum, bt);
            for (ll T = 1; T <= min(b, n - a - 1); T++)
            {
                ll y1 = b - T - 1;
                ll x1 = a + (T + b % 2)/2;
                ll y2 = b;
                ll x2 = a + T;
                sum += getv(x2, y2) - getv(x1, y1);
                bt = max(sum, bt);
            }
        }
    

    cout << t + bt;
    //
    //cout << "\n";
    //bool even = true;
    //for (int b = 0; b < m; b++)
    //{
    //    for (int a = 0; a < n; a++)
    //        cout << v[a][b] << " ";
    //
    //    cout << "\n";
    //    if (even)
    //        cout << " ";
    //    even = !even;
    //}

#else 
    n = 500;
    m = 500;

    v.resize(m * n, 0);
    

    ll bt = 0;
    for (ll a = 0; a < n; a++)
        for (ll b = 0; b < m; b++)
        {
            ll sum = getv(a, b) - getv(a - (b + 1) % 2, b - 1);
            bt = max(sum, bt);
            for (ll T = 1; T <= min(m - b - 1, a); T++)
            {
                ll y1 = b - 1;
                ll x1 = a - T - ((y1 - 1) / 2 - b / 2);
                ll y2 = b + T;
                ll x2 = a - ((y2 - 1) / 2 - b / 2);
                sum += getv(x2, y2) - getv(x1, y1);
                bt = max(sum, bt);
            }
        }

    for (ll a = 0; a < n; a++)
        for (ll b = 0; b < m; b++)
        {
            ll sum = getv(a, b) - getv(a - (b + 1) % 2, b - 1);
            bt = max(sum, bt);
            for (ll T = 1; T <= min(b, n - a - 1); T++)
            {
                ll y1 = b - T - 1;
                ll x1 = a + (T + b % 2) / 2;
                ll y2 = b;
                ll x2 = a + T;
                sum += getv(x2, y2) - getv(x1, y1);
                bt = max(sum, bt);
            }
        }

    //trigD(2, 1, 4);
    
    //bool even = true;
    //for (int b = 0; b < m; b++)
    //{
    //    for (int a = 0; a < n; a++)
    //        cout << getv(a,b) << " ";
    //
    //    cout << "\n";
    //    if (even)
    //        cout << " ";
    //    even = !even;
    //}
    //cout << "\n";

#endif

    return 0;
}

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
3

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
42

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
5

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
63

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
8

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:

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

correct output
20

user output
21

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
29

Test 14

Group: 1, 2

Verdict:

input
10 10 100
2 9 H
5 4 H
5 9 K
6 1 K
...

correct output
-439

user output
-450

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
95

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

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
136434

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
274748

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
11040

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

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