Submission #1212996

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212996		Sofiatpc	Jelly Flavours (IOI20_jelly)	C++20	24 / 100	69 ms	78664 KiB

jelly

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

using namespace std;

#define fi first
#define sc second
const int MAXN = 2005, MAX = 1e4+5;
int dp[MAXN][MAX];
vector< pair<int,int> > v;

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

	for(int i = 0; i < n; i++)v.push_back({a[i],b[i]});
	sort(v.begin(),v.end());

	int ans = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= x; j++){
			dp[i][j] = dp[i-1][j]+v[i-1].sc;
			if(j >= v[i-1].fi) dp[i][j] = min(dp[i][j], dp[i-1][j - v[i-1].fi]);
		}

		if(dp[i][x] <= y)ans = i;
	}

	return ans;
}

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