Submission #655649

#	Time	Username	Problem	Language	Result	Execution time	Memory
655649		zegna12	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	40 ms	472 KiB

jelly

#include <bits/stdc++.h>
using namespace std;
int find_maximum_unique(int X, int Y, vector<int> a, vector<int> b) {
	int N = X + 2 * Y, M = a.size() & 1;
	for (auto& x : b)
		x *= 2;
	vector<vector<int>> dp(2, vector<int> (N + 1, 0));
	for (int _ = 0; _ < (int)a.size(); ++_) {
		int x = a[_];
		int y = b[_];
		for (int j = N; j >= x; --j)
			dp[_ & 1][j] = max(dp[_ & 1][j], dp[(_ & 1) ^ 1][j - x] + 1);
		for (int j = N; j >= y; --j)
			dp[_ & 1][j] = max(dp[_ & 1][j], dp[(_ & 1) ^ 1][j - y] + 1);
	}
	return *max_element(dp[M].begin(), dp[M].end());
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 24
• Subtask 3: 0 / 9
• Subtask 4: 0 / 10
• Subtask 5: 0 / 14
• Subtask 6: 0 / 32