Submission #1209374

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209374		stdfloat	Catfish Farm (IOI22_fish)	C++20	0 / 100	959 ms	2162688 KiB

fish

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

using ll = long long;

ll max_weights(int n, int M, vector<int> X, vector<int> Y, vector<int> W) {
	vector<vector<ll>> p(n + 1, vector<ll>(n + 1));
	for (int i = 0; i < M; i++)
		p[++X[i]][++Y[i]] = W[i];

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			p[i][j] += p[i][j - 1];
	}

	vector<vector<ll>> dp(n + 1, vector<ll>(n + 1)), mx = dp;
	for (int i = 2; i <= n; i++) {
		for (int j = 0; j <= n; j++) {
			for (int k = 0; k <= n; k++) {
				if (k < j) dp[i][j] = max(dp[i][j], mx[i - 2][k] + p[i - 1][j] - p[i - 1][k]);
				else dp[i][j] = max(dp[i][j], dp[i - 1][k] + p[i][k] - p[i][j]);
			}
		}

		for (int j = 1; j <= n; j++)
			mx[i][j] = max(mx[i][j - 1], dp[i][j]);
	}

	return *max_element(dp[n].begin(), dp[n].end());
}

• 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