Submission #785133

#	Time	Username	Problem	Language	Result	Execution time	Memory
785133		khshg	Catfish Farm (IOI22_fish)	C++17	0 / 100	847 ms	2097156 KiB

fish

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

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	vector<vector<int>> c(N + 1, vector<int>(N + 1));
	for(int i = 0; i < M; ++i) {
		c[X[i]][Y[i]] = W[i];
	}
	vector<vector<long long>> dp(N + 1, vector<long long>(N + 1)), bestdp;
	bestdp = dp;
	dp[0][0] = 0;
	bestdp[0][0] = 0;
	for(int i = 1; i <= N; ++i) {
		dp[0][i] = dp[0][i - 1] + c[1][i - 1];
		bestdp[0][i] = max(bestdp[0][i - 1], dp[0][i]);
	}
	for(int i = 1; i < N; ++i) {
		dp[i][0] = 0;
		for(int j = 0; j <= N; ++j) {
			dp[i][0] = max(dp[i][0], dp[i - 1][j]);
		}
		bestdp[i][0] = dp[i][0];
		for(int j = 1; j <= N; ++j) {
			dp[i][j] = bestdp[i - 1][N] - c[i][j - 1];
			dp[i][j] = max(dp[i][j], (i - 2 < 0 ? 0 : bestdp[i - 2][j - 1]) + c[i - 1][j - 1]);
			dp[i][j] = max(dp[i][j], (i - 2 < 0 ? 0 : bestdp[i - 2][N]));
			dp[i][j] += c[i + 1][j - 1];
			bestdp[i][j] = max(bestdp[i][j - 1], dp[i][j]);
		}
	}
	return bestdp[N - 1][N];
}

• 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