Submission #702771

#	Time	Username	Problem	Language	Result	Execution time	Memory
702771		acceptify	Catfish Farm (IOI22_fish)	C++17	14 / 100	52 ms	8108 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll mxn = 305;

ll n, m, n2, w[mxn][12], ps[mxn][12], dp[mxn][12][12][12], res = 0;

ll get(ll x, ll y, ll y2) {
    return (y <= y2 ? ps[x][y2] - ps[x][y] : 0);
}

ll calc(ll p, ll h2, ll h1, ll h) {
    return get(p, h1, max(h, h2));
}

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N, m = M, n2 = min(n + 1, 10LL);
    for (int i = 0; i < m; i++) w[X[i] + 1][Y[i] + 1] = W[i];
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n2; j++) ps[i][j] = ps[i][j - 1] + w[i][j];
    if (n < 3) return max(ps[1][n2], ps[2][n2]);
    for (int h = 0; h <= n2; h++) for (int h1 = 0; h1 <= n2; h1++) for (int h2 = 0; h2 <= n2; h2++) {
        dp[3][h2][h1][h] = calc(1, 0, h2, h1) + calc(2, h2, h1, h);
    }
    for (int i = 4; i <= n; i++) {
        for (int h = 0; h <= n2; h++) for (int h1 = 0; h1 <= n2; h1++) for (int h2 = 0; h2 <= n2; h2++) {
            for (int h3 = 0; h3 <= n2; h3++) {
                dp[i][h2][h1][h] = max(dp[i][h2][h1][h], dp[i - 1][h3][h2][h1] + calc(i - 1, h2, h1, h));
            }
        }
    }
    for (int h = 0; h <= n2; h++) for (int h1 = 0; h1 <= n2; h1++) for (int h2 = 0; h2 <= n2; h2++) {
        res = max(res, dp[n][h2][h1][h] + calc(n, h1, h, 0));
    }
    return res;
}

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