Submission #1260941

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260941		rayan_bd	Catfish Farm (IOI22_fish)	C++20	0 / 100	1096 ms	6580 KiB

fish

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

static long long dp[305][305];
static long long ndp[305][305];

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    vector<vector<pair<int,int>>> fish(N+1);
    for (int i = 0; i < M; i++) {
        fish[X[i]+1].push_back({Y[i]+1, W[i]});
    }

    for (int h = 0; h <= N; h++) dp[0][h] = 0;

    for (int c = 1; c <= N; c++) {
        for (int h = 0; h <= N; h++) ndp[c][h] = LLONG_MIN;

        for (int h = 0; h <= N; h++) {
            for (int k = 0; k <= N; k++) {
                if (dp[c-1][k] == LLONG_MIN) continue;
                long long add = 0;
                for (auto [y, w] : fish[c]) {
                    if (y >= h && k > y) {
                        add += w;
                    }
                }
                ndp[c][h] = max(ndp[c][h], dp[c-1][k] + add);
            }
        }

        for (int h = 0; h <= N; h++) dp[c][h] = ndp[c][h];
    }

    long long ans = 0;
    for (int h = 0; h <= N; h++) ans = max(ans, dp[N][h]);
    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