Submission #1169042

#TimeUsernameProblemLanguageResultExecution timeMemory
11690424QT0RJelly Flavours (IOI20_jelly)C++20
44 / 100
2098 ms51016 KiB
#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b){
	int n = a.size();
	vector<vector<int>> dp(x+1,vector<int>(y+1));
	int zeros=0;
	int mx=0;
	for (int i = 0; i<n; i++){
		if (!a[i] || !b[i]){
			zeros++;
			continue;
		}
		for (int j = x; j>=0; j--){
			for (int u = y; u>=0; u--){
				if (j>=a[i])dp[j][u]=max(dp[j][u],dp[j-a[i]][u]+1);
				if (u>=b[i])dp[j][u]=max(dp[j][u],dp[j][u-b[i]]+1);
				mx=max(mx,dp[j][u]);
			}
		}
	}
	return mx+zeros;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...