CSES - Datatähti 2024 alku

CSES - Datatähti 2024 alku - Results

Submission details
Task:	Uolevin kalansaalis
Sender:	stpn129
Submission time:	2023-10-31 22:30:21 +0200
Language:	C++ (C++17)
Status:	READY
Result:	37

Feedback
group	verdict	score
#1	ACCEPTED	37
#2	TIME LIMIT EXCEEDED	0

Test results
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.01 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	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details

Code

#include <bits/stdc++.h>

using namespace std;

void init_code() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}

inline  vector<pair<int, int>> adj(pair<int, int> cell) {
    vector<pair<int, int>> res;
    int i = cell.first, j = cell.second;
    if (i % 2 == 0) {
        res = {{i, j - 1}, {i - 1, j}, {i - 1, j + 1}, {i, j + 1}, {i + 1, j + 1}, {i + 1, j}};
    } else {
        res = {{i, j - 1}, {i - 1, j - 1}, {i - 1, j}, {i, j + 1}, {i + 1, j}, {i + 1, j - 1}};
    }

    return res;
}

inline bool ok(pair<int, int> cell, int n, int m) {
    return cell.first >= 1 && cell.first <= n && cell.second >= 1 && cell.second <= m;
}

const int inf = 1e9;
void solve() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<int>> g(n + 1, vector<int> (m + 1, 0)); 
    
    int s = 0;
    for (int i = 1; i <= k; ++i) {
        int a, b;
        cin >> a >> b;
        char c;
        cin >> c;

        if (c == 'H') {
            g[a][b] = 1;
        } else {
            g[a][b] = -10;
        }

        s += g[a][b];
    }

    vector<vector<int>> p1(n + 1, vector<int> (m + 1, 0));

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p1[i][j] += g[i][j];
            
            if (ok(adjs[0], n, m))
                p1[i][j] += p1[adjs[0].first][adjs[0].second];

            if (ok(adjs[1], n, m))
                p1[i][j] += p1[adjs[1].first][adjs[1].second];
            
            if (ok({adjs[1].first, adjs[1].second - 1}, n, m))
                p1[i][j] -= p1[adjs[1].first][adjs[1].second - 1];
        }
    }
    
    vector<vector<int>> p2(n + 1, vector<int> (m + 1, 0));

    for (int i = 1; i <= n; ++i) {
        for (int j = m; j >= 1; --j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p2[i][j] += g[i][j];
            
            if (ok(adjs[2], n, m))
                p2[i][j] += p2[adjs[2].first][adjs[2].second];

            if (ok(adjs[3], n, m))
                p2[i][j] += p2[adjs[3].first][adjs[3].second];
            
            if (ok({adjs[2].first, adjs[2].second + 1}, n, m))
                p2[i][j] -= p2[adjs[2].first][adjs[2].second + 1];
        }
    }

    vector<vector<int>> p3(n + 1, vector<int> (m + 1, 0));

    for (int i = n; i >= 1; --i) {
        for (int j = 1; j <= m; ++j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p3[i][j] += g[i][j];
            
            if (ok(adjs[0], n, m))
                p3[i][j] += p3[adjs[0].first][adjs[0].second];

            if (ok(adjs[5], n, m))
                p3[i][j] += p3[adjs[5].first][adjs[5].second];
            
            if (ok({adjs[5].first, adjs[5].second - 1}, n, m))
                p3[i][j] -= p3[adjs[5].first][adjs[5].second - 1];
        }
    }

    vector<vector<int>> p4(n + 1, vector<int> (m + 1, 0));

    for (int i = n; i >= 1; --i) {
        for (int j = m; j >= 1; --j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p4[i][j] += g[i][j];
            
            if (ok(adjs[3], n, m))
                p4[i][j] += p4[adjs[3].first][adjs[3].second];

            if (ok(adjs[4], n, m))
                p4[i][j] += p4[adjs[4].first][adjs[4].second];
            
            if (ok({adjs[4].first, adjs[4].second + 1}, n, m))
                p4[i][j] -= p4[adjs[4].first][adjs[4].second + 1];
        }
    }
    
    vector<int> p0(n + 1), p5(n + 2);
    for (int i = 1; i <= n; ++i) {
        p0[i] += p0[i - 1];
        for (int j = 1; j <= m; ++j) {
            p0[i] += g[i][j];
        }

        p5[n - i + 1] += s - p0[i - 1];
    }

    int mn = inf;
    for (int t = 1; t <= min(n, m); ++t) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                //up
                int ux1 = i + t - 1, uy1, ux2 = i + t - 1, uy2;
                if (i % 2 == 1) {
                    uy2 = j + (t - 1) / 2;
                    uy1 = uy2 - (t - 1); 
                } else {
                    uy1 = j - (t - 1) / 2;
                    uy2 = uy1 + (t - 1);
                }
                if (ok({ux1, uy1}, n, m) && ok({ux2, uy2}, n, m)) {
                    int tmp = s;
                    tmp -= p0[i - 1];
                    tmp -= p5[n - ux1];
                    vector<pair<int, int>> a0 = adj({i, j}), a1 = adj({ux1, uy1}), a2 = adj({ux2, uy2});
                    vector<pair<int, int>> a_a1 = adj(a1[0]), a_a2 = adj(a2[3]);
                    int x = 0;
                    if (ok(a0[0], n, m)) {
                        x += p3[a0[0].first][a0[0].second];
                    }
                    if (ok(a_a1[5], n, m)) {
                        x -= p3[a_a1[5].first][a_a1[5].second];
                    }
                    tmp -= x;

                    int y = 0;
                    if (ok(a0[3], n, m)) {
                        y += p4[a0[3].first][a0[3].second];
                    }
                    if (ok(a_a2[4], n, m)) {
                        y -= p4[a_a2[4].first][a_a2[4].second];
                    }

                    tmp -= y;
                    //cout << t << ' ' << ux1 << ' ' << uy1 << ' ' << tmp << '\n'; 
                    mn = min(mn, tmp);
                }


                //down
                int px1 = i - (t - 1), py1, px2 = i - (t - 1), py2;
                if (i % 2 == 1) {
                    py2 = j + (t - 1) / 2;
                    py1 = py2 - (t - 1); 
                } else {
                    py1 = j - (t - 1) / 2;
                    py2 = py1 + (t - 1);
                }

                if (ok({px1, py1}, n, m) && ok({px2, py2}, n, m)) {
                    int tmp = s;
                    tmp -= p0[px1 - 1];
                    tmp -= p5[n - i];
                    
                    vector<pair<int, int>> a0 = adj({i, j}), a1 = adj({px1, py1}),
                    a2 = adj({px2, py2});
                    vector<pair<int, int>> a_a1 = adj(a1[0]), a_a2 = adj(a2[3]);
                    
                    int x = 0;
                    if (ok(a0[0], n, m)) {
                        x += p1[a0[0].first][a0[0].second];
                    }
                    if (ok(a_a1[1], n, m)) {
                        x -= p1[a_a1[1].first][a_a1[1].second];
                    }
                    tmp -= x;

                    int y = 0;
                    if (ok(a0[3], n, m)) {
                        y += p2[a0[3].first][a0[3].second];
                    }
                    if (ok(a_a2[2], n, m)) {
                        y -= p2[a_a2[2].first][a_a2[2].second];
                    }

                    tmp -= y;
                    //cout << t << ' ' << ux1 << ' ' << uy1 << ' ' << tmp << '\n'; 
                    mn = min(mn, tmp);
                }
            }   
        }
    }

    cout << s - mn << '\n';
}

signed main() {
  init_code();
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  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 ...` view save

correct output
`-16` view save

user output
`-16` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 7 1 5 K 4 6 K 2 4 H 2 5 H ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 7 5 5 K 2 6 K 2 4 H 2 5 H ...` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 51 3 3 H 6 3 H 9 5 H 5 10 H ...` view save

correct output
`50` view save

user output
`50` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

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

correct output
`40` view save

user output
`40` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 60 6 10 H 2 8 H 5 8 H 8 10 H ...` view save

correct output
`-15` view save

user output
`-15` view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 60 4 7 H 7 4 H 4 10 H 3 6 H ...` view save

correct output
`60` view save

user output
`60` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 40 9 9 H 5 10 H 5 6 H 4 9 H ...` view save

correct output
`2` view save

user output
`2` view save

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 0` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 1 1 1 K` view save

correct output
`0` view save

user output
`0` view save

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 1 1 1 H` view save

correct output
`0` view save

user output
`0` view save

Test 12

Group: 1, 2

Verdict: ACCEPTED

input
`10 5 32 10 3 H 4 4 H 3 3 H 5 4 H ...` view save

correct output
`20` view save

user output
`20` view save

Test 13

Group: 1, 2

Verdict: ACCEPTED

input
`5 10 32 5 9 H 2 4 H 2 9 H 2 5 H ...` view save

correct output
`28` view save

user output
`28` view save

Test 14

Group: 1, 2

Verdict: ACCEPTED

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

correct output
`-439` view save

user output
`-439` view save

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 100 8 9 H 5 10 H 5 4 H 3 9 H ...` view save

correct output
`88` view save

user output
`88` view save

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 125000 125 261 K 84 78 K 11 200 K 481 246 K ...` view save

correct output
`-624270` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
`124020` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 249999 22 214 H 356 145 H 341 29 H 393 262 H ...` view save

correct output
`249999` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 32000 30 81 H 315 34 H 78 112 H 367 166 H ...` view save

correct output
`10126` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 126745 164 390 H 126 331 H 164 126 H 55 92 H ...` view save

correct output
`-104692` view save

user output
(empty)

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 71200 106 191 H 314 189 H 482 485 H 344 401 H ...` view save

correct output
`-335853` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 67772 421 277 H 428 470 H 169 142 H 256 345 H ...` view save

correct output
`-208567` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 27434 366 481 H 38 22 H 126 107 H 135 169 H ...` view save

correct output
`-57100` view save

user output
(empty)

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 93982 183 13 H 463 230 H 264 351 H 399 290 H ...` view save

correct output
`-52800` view save

user output
(empty)

Datatähti 2024 alku

Uolevin kalansaalis

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Tasks

Submissions (stpn129)