Submission #983680

#	Time	Username	Problem	Language	Result	Execution time	Memory
983680		Sofiatpc	Jelly Flavours (IOI20_jelly)	C++14	35 / 100	201 ms	193764 KiB

jelly

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

using namespace std;

const int MAXN = 205, MAX = 505;
int dp[MAXN][MAX][MAX];

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

	for(int i = n; i >= 1; i--)
		for(int j = 0; j <= x; j++)
			for(int k = 0; k <= y; k++){
				dp[i][j][k] = dp[i+1][j][k];
				if(j >= a[i-1])dp[i][j][k] = max(dp[i][j][k], dp[i+1][j-a[i-1]][k]+1);
				if(k >= b[i-1])dp[i][j][k] = max(dp[i][j][k], dp[i+1][j][k-b[i-1]]+1);
			}
	return dp[1][x][y];
}

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