Submission #1201415

#TimeUsernameProblemLanguageResultExecution timeMemory
1201415ezzzayJelly Flavours (IOI20_jelly)C++20
0 / 100
2096 ms51016 KiB
#include "jelly.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	
	int n = a.size();
	vector< vector<int> > dp (x+1, vector<int>(y+1));
	int ans=0;
	for(int k=0;k<n;k++){
		for(int i=a[k];i<=x;i++){
			for(int j=b[k];j<=y;j++){
				dp[i-a[k]][j]=max(dp[i][j]+1,dp[i-a[k]][j]);
				dp[i][j-b[k]]=max(dp[i][j]+1,dp[i][j-b[k]]);
				ans=max(ans,dp[i-a[k]][j]);
				ans=max(ans,dp[i][j-b[k]]);
			}
		}
	}
	return ans;
}
#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...