Submission #429919

#	Time	Username	Problem	Language	Result	Execution time	Memory
429919		tinjyu	Jelly Flavours (IOI20_jelly)	C++14	9 / 100	55 ms	580 KiB

jelly

#include "jelly.h"
#include <vector>
#include <iostream>
using namespace std;
long long int dp[100005][2];
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();
	for(int i=0;i<n;i++)
	{
		for(int j=i-1;j>=0;j--)
		{
			if(a[j+1]<a[j])
			{
				swap(a[j+1],a[j]);
				swap(b[j+1],b[j]);
			}
		}
	}
	for(int i=1;i<=y;i++)
	{
		dp[i][0]=-1;
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<=y;j++)
		{
			long long int tmpc=-1,tmpd=0;
			if(dp[j][1]+a[i]<=x)
			{
				tmpc=dp[j][0]+1;
				tmpd=dp[j][1]+a[i];
			}
			if(j>=b[i])
			{
				if(dp[j-b[i]][0]+1>tmpc || (dp[j-b[i]][0]+1==tmpc && dp[j-b[i]][1]<tmpd))
				{
					tmpc=dp[j-b[i]][0]+1;
					tmpd=dp[j-b[i]][1];
				}
			}
			//cout<<tmpc<<" "<<tmpd<<"  ";
			if(tmpc>dp[j][0] || (dp[j][0]==tmpc && dp[j][1]>tmpd))
			{
				dp[j][0]=tmpc;
				dp[j][1]=tmpd;
			}
			//cout<<dp[j][0]<<" "<<dp[j][1]<<"  ";
		}
		//cout<<endl;
	}
	long long int ans=0;
	for(int i=0;i<=y;i++)
	{
		ans=max(dp[i][0],ans);
	}
	return ans;
}

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