제출 #673755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673755		mmk	Jelly Flavours (IOI20_jelly)	C++17	100 / 100	128 ms	157188 KiB

jelly

#include <bits/stdc++.h>
#include "jelly.h"
#define fr first
#define sc second
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e3+10;
const int MAXX = 1e4+10;
struct jelly
{
	int a,b;
};
jelly val[MAXN];
bool cmp(jelly p, jelly q)
{
	return p.a < q.a;
}
pair<int,int> dp[MAXN][MAXX];
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b)
{
	int n = a.size();
	for(int i = 1; i <= n; i++)
	{
		val[i].a = a[i-1];
		val[i].b = b[i-1];
 	}
 	sort(val+1,val+(n+1),cmp);
	dp[0][0] = {0,x};
	for(int i = 1; i <= y; i++)
		dp[0][i] = {-1,-1};
	int resp = 0;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 0; j <= y; j++)
		{
			dp[i][j] = dp[i-1][j];
			if(dp[i][j].sc >= val[i].a)
			{
				dp[i][j].fr++;
				dp[i][j].sc -= val[i].a;
			}
			if(j >= val[i].b)
			{
				pair<int,int> aux = dp[i-1][j-val[i].b];
				aux.fr++;
				if(aux.fr > dp[i][j].fr || (aux.fr == dp[i][j].fr && aux.sc > dp[i][j].sc))
					dp[i][j] = aux;
			}
			resp = max(resp,dp[i][j].fr);
		}
	}
	return resp;
}

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