Submission #426292

#	Time	Username	Problem	Language	Result	Execution time	Memory
426292		Apiram	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	212 ms	148192 KiB

jelly

#include "jelly.h"
#include <cstdio>
#include <cassert>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int find_maximum_unique(int x, int y, std::vector<int> arr, std::vector<int> brr) {
	int n = arr.size();
	vector<int>crr;
	
	int dp [n+1][x+1+y+1];
	memset(dp,0,sizeof dp);
	for (int i =1;i<=n;++i){
		for (int j =0;j<=x+y+1;++j){
		dp[i][j] = max({(j-arr[i-1]>=0&&j<=x)?dp[i-1][j-arr[i-1]]+1:0,(j-brr[i-1]>x)?dp[i-1][j-brr[i-1]]+1:0,dp[i-1][j],dp[i][j]});
		}
	}
	return dp[n][x+y]+dp[n][x];
}

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