Submission #1229402

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229402		maya_s	Jelly Flavours (IOI20_jelly)	C++20	35 / 100	2102 ms	393344 KiB

jelly

#include <bits/stdc++.h>
using namespace std;
typedef int ll;

ll dp[201][501][501][2];

int find_maximum_unique(int x, int y, vector<int> A, vector<int> B) {
	ll n = A.size();
	vector<ll> a(n+1), b(n+1);
	for(ll i = 0; i < n; i++) a[i+1] = A[i], b[i+1] = B[i];
	for(ll i = 1; i <= n; i++){
		for(ll sum_a = 0; sum_a <= x; sum_a++){
			for(ll sum_b = 0; sum_b <= y; sum_b++){
                dp[i][sum_a][sum_b][0] = dp[i][sum_a][sum_b][1] = max(dp[i-1][sum_a][sum_b][0], dp[i-1][sum_a][sum_b][1]);
				if(sum_a - a[i] >= 0) dp[i][sum_a][sum_b][0] = max(dp[i][sum_a][sum_b][0], max(dp[i-1][sum_a - a[i]][sum_b][0], dp[i-1][sum_a - a[i]][sum_b][1]) + 1);
				if(sum_b - b[i] >= 0) dp[i][sum_a][sum_b][1] = max(dp[i][sum_a][sum_b][1], max(dp[i-1][sum_a][sum_b - b[i]][0], dp[i-1][sum_a][sum_b - b[i]][1]) + 1);
			}
		}
	}
	return max(dp[n][x][y][0], dp[n][x][y][1]);
}

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