Submission #1179497

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179497		gyg	메기 농장 (IOI22_fish)	C++20	0 / 100	46 ms	38724 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define sig signed
#define int long long
#define arr array 
#define vec vector
const int N = 1e5 + 5;

int n;
arr<arr<int, N>, 10> a;

arr<arr<int, N>, 10> sm;
int rng(int i, int l, int r) {
    if (l > r) return 0;
    return sm[i][r] - sm[i][l - 1];
}
void sm_cmp() {
    for (int i = 1; i <= 5; i++) {
        for (int j = 1; j <= n; j++) {
            sm[i][j] = sm[i][j - 1] + a[i][j];
        }
    }
}

arr<arr<arr<arr<int, 2>, N>, 10>, 3> mx;
arr<arr<arr<int, 2>, N>, 10> dp;
void slv(int i, int x, int b) {
    dp[i][x][b] = rng(i - 1, 1, x);

    if (b == 1) {
        if (i - 1 >= 1) {
            for (int c : {0, 1}) {
                dp[i][x][b] = max(dp[i][x][b], mx[2][i - 1][x][c] - sm[i][x]);
            }
        }
        // cout << i << " " << x << " " << b << ": " << dp[i][x][b] << '\n';
        return;
    }

    if (i - 3 >= 1) {
        for (int c : {0, 1}) {
            dp[i][x][b] = max(dp[i][x][b], mx[2][i - 3][1][c] + sm[i - 1][x]);
        }
    }
    if (i - 2 >= 1) {
        for (int c : {0, 1}) {
            dp[i][x][b] = max(dp[i][x][b], mx[2][i - 2][x][c]);
        }
        for (int c : {0, 1}) {
            dp[i][x][b] = max(dp[i][x][b], mx[0][i - 2][x - 1][c] + sm[i - 1][x]);
        }
    }
    if (i - 1 >= 1) {
        dp[i][x][b] = max(dp[i][x][b], mx[1][i - 1][x - 1][0] + sm[i - 1][x]);
    }
     
    // cout << i << " " << x << " " << b << ": " << dp[i][x][b] << '\n';
}
void dp_cmp() {
    for (int i = 1; i <= 5; i++) {
        for (int x = 1; x <= n; x++) {
            for (int b : {0, 1}) {
                slv(i, x, b);
            }
        }
            
        for (int x = 1; x <= n; x++) {
            for (int b : {0, 1}) {
                mx[0][i][x][b] = max(mx[0][i][x - 1][b], dp[i][x][b]);
                mx[1][i][x][b] = max(mx[1][i][x - 1][b], dp[i][x][b] - sm[i][x]);
            }
        }
        for (int x = n; x >= 1; x--) {
            for (int b : {0, 1}) {
                mx[2][i][x][b] = max(mx[2][i][x + 1][b], dp[i][x][b] + sm[i + 1][x]);
            }
        }
    }
}

int max_weights(sig _n, sig _m, vec<sig> _x, vec<sig> _y, vec<sig> _w) {
    n = _n;
    for (int i = 0; i < _m; i++) a[_x[i] + 1][_y[i] + 1] = _w[i];

    sm_cmp();
    dp_cmp();

    int ans = 0;
    for (int i = 1; i <= 2; i++) {
        for (int x = 1; x <= n; x++) {
            for (int b : {0, 1}) {
                ans = max(ans, dp[i][x][b] + rng(i + 1, 1, x));
            }
        }
    }
    return ans;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16