Submission #983683

#	Time	Username	Problem	Language	Result	Execution time	Memory
983683		Sofiatpc	Jelly Flavours (IOI20_jelly)	C++14	10 / 100	48 ms	78808 KiB

jelly

#include "jelly.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2005, MAX = 1e4+5;
int dp[MAXN][MAX];

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();

	for(int i = n; i >= 1; i--)
		for(int j = 0; j <= x; j++){
			dp[i][j] = dp[i+1][j];
			if(j >= a[i-1])dp[i][j] = max(dp[i+1][j], dp[i+1][j-a[i-1]]+1);
		}
	int qtd;
	if(b[0] == 0)qtd = n;
	else qtd = y/b[0];
	return dp[1][x] + min(qtd,n-dp[1][x]);
}

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