Submission #1210669

#	Time	Username	Problem	Language	Result	Execution time	Memory
1210669		Nicolaikrob	Catfish Farm (IOI22_fish)	C++17	9 / 100	16 ms	5448 KiB

fish

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

ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W) {
	vector<int> G(n, 0);
	for(int i = 0; i < m; i++) G[X[i]] = W[i];
	vector<vector<ll>> DP(2, vector<ll> (n, 0));
	DP[0][1] = G[1];
	DP[1][1] = G[0];
	for(int i = 2; i < n; i++) {
		DP[0][i] = max(DP[0][i-1], DP[1][i-1]+G[i]);
		DP[1][i] = max(DP[1][i-1], max(DP[1][i-2], DP[0][i-2])+G[i-1]);
	}
	return max(DP[0][n-1], DP[1][n-1]);
}

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