Submission #1169234

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169234		Roupiq	Jelly Flavours (IOI20_jelly)	C++20	35 / 100	2097 ms	51016 KiB

jelly

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

#define maxeq(a, b) a = max(a, b)

template <typename T>
ostream &operator<<(ostream &o, const vector<T> &v)
{
	o << "[";
	for (int i = 0; i < size(v); i++)
	{
		o << (i ? "," : "") << v[i];
	}
	o << "]";
	return o;
}

int dp_solve(int x, int y, std::vector<int> a, std::vector<int> b)
{
	vector<vector<int>> dp;
	dp.resize(x + 1, vector<int>(y + 1, INT_MIN));
	dp[0][0] = 0;
	for (int p = 0; p < size(a); p++)
	{
		for (int i = x; i >= 0; i--)
		{
			for (int j = y; j >= 0; j--)
			{
				if (i - a[p] >= 0)
					maxeq(dp[i][j], dp[i - a[p]][j] + 1);
				if (j - b[p] >= 0)
					maxeq(dp[i][j], dp[i][j - b[p]] + 1);
			}
		}
	}
	int res = 0;
	for (int i = 0; i <= x; i++)
	{
		for (int j = 0; j <= y; j++)
		{
			maxeq(res, dp[i][j]);
		}
	}
	return res;
}

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b)
{
	int n = dp_solve(x, y, a, b);
	return n;
}

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