Submission #983686

#	Time	Username	Problem	Language	Result	Execution time	Memory
983686		mmk	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	23 ms	7004 KiB

jelly

#include "jelly.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 10;
const int MAXM = 1e4 + 10;

int dp[MAXN][MAXM];

int calc(int i, int x, int y, int N, vector<int> &a, vector<int> &b)
{
	if(x < 0 || y < 0) return -1;
	if(dp[i][x] != 0) return dp[i][x];
	if(i > N) return 0;

	int op1 = calc(i + 1, x - a[i - 1], y, N, a, b) + 1;
	int op2 = calc(i + 1, x, y - b[i - 1], N , a, b) + 1;

	dp[i][x] = max(op1,op2);
	return dp[i][x];
}


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

	sort(a.begin(),a.end());
	sort(b.begin(),b.end());

	return calc(1,x,y,N,a,b);

}

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