Submission #1168996

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168996		Zbyszek99	Jelly Flavours (IOI20_jelly)	C++17	100 / 100	132 ms	78664 KiB

jelly

#include "jelly.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define vi vector<int>
#define vl vector<long long>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int dp[2001][10'001];

int find_maximum_unique(int x, int y, vi a, vi b) {
	int n = siz(a);
	vector<pii> p(n+1);
	rep(i,n) p[i+1] = {a[i],b[i]};
	sort(all(p));
	dp[0][x] = y;
	rep2(i,0,x-1) dp[0][i] = -1;
	rep2(i,1,n)
	{
		rep2(k,0,x)
		{
			dp[i][k] = -1;
			// biore a
			if(k + p[i].ff <= x)
			{
				dp[i][k] = max(dp[i][k],dp[i-1][k+p[i].ff]);
			}
			if(dp[i-1][k] - p[i].ss >= 0)
			{
				dp[i][k] = max(dp[i][k],dp[i-1][k]-p[i].ss);
			}
		}
	}
	int ans = 0;
	rep2(pref,0,n)
	{
		int zost = -1;
		rep2(k,0,x) zost = max(zost,dp[pref][k]);
		//cout << p[pref].ff << " " << p[pref].ss << " " << pref << " " << zost << " pref\n";
		if(zost == -1) break;
		vi rest;
		rep2(j,pref+1,n)
		{
			rest.pb(p[j].ss);
		}
		sort(all(rest));
		reverse(all(rest));
		int cur_ans = pref;
		while(siz(rest) > 0 && rest.back() <= zost)
		{
			cur_ans++;
			zost -= rest.back();
			rest.pop_back();
		}
		ans = max(ans,cur_ans);
	}
	return ans;
}

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