제출 #983677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983677		mmk	Jelly Flavours (IOI20_jelly)	C++14	35 / 100	754 ms	1046868 KiB

jelly

#include "jelly.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 510;

int dp[MAXN][MAXN][MAXN];

int calc(int i, int x, int y, int N, vector<int> &a, vector<int> &b)
{
	if(x < 0 || y < 0) return -1;
	if(dp[i][x][y] != 0) return dp[i][x][y];
	if(i > N) return 0;

	int op1 = calc(i + 1, x - a[i - 1], y, N, a, b) + 1;
	int op2 = calc(i + 1, x, y - b[i - 1], N, a, b) + 1;
	int op3 = calc(i + 1, x , y , N, a, b);

	dp[i][x][y] = max(max(op1,op2),op3);
	// cerr << dp[i][x][y] << " " << i << " " << x << " " << y << "\n";
	return dp[i][x][y];
}


int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int N = a.size();

	for(int i = 0; i <= N + 5; i++)
	{
		for(int j = 0; j <= N + 5; j ++)
		{
			for(int k = 0; k <= N + 5; k++)
				dp[i][j][k] = 0;
		}
	}

	return calc(1,x,y,N,a,b);
}

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