제출 #434579

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434579		Blagojce	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	113 ms	163004 KiB

jelly

#include <bits/stdc++.h>

#include "jelly.h"
//#include "grader.cpp"

#include <vector>

using namespace std;


int N;

vector<int> A;
vector<int> B;

int memo[502][202][202];

int dp(int pos, int remx, int remy){
	if(pos == 0) return 0;
	
	if(memo[pos][remx][remy] != -1) return memo[pos][remx][remy];
	
	int ret = dp(pos-1, remx, remy);
	if(remx >= A[pos-1]){
		ret = max(ret, dp(pos-1, remx-A[pos-1], remy) + 1);
	}
	if(remy >= B[pos-1]){
		ret = max(ret, dp(pos-1, remx, remy-B[pos-1]) + 1);
	}
	memo[pos][remx][remy] = ret;
	
	return ret;
}

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	memset(memo, -1, sizeof(memo));
	N = a.size();
	A = a;
	B = b;
	return dp(N, x, y);
}

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