제출 #983679

#제출 시각아이디문제언어결과실행 시간메모리
983679SofiatpcJelly Flavours (IOI20_jelly)C++14
0 / 100
8 ms13112 KiB
#include "jelly.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 205, MAX = 505;
int dp[MAXN][MAX][MAX];

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

	for(int i = n; i >= 1; i--)
		for(int j = 1; j <= x; j++)
			for(int k = 1; k <= y; k++){
				dp[i][j][k] = dp[i+1][j][k];
				if(j >= a[i-1])dp[i][j][k] = max(dp[i][j][k], dp[i+1][j-a[i-1]][k]+1);
				if(k >= b[i-1])dp[i][j][k] = max(dp[i][j][k], dp[i+1][j][k-b[i-1]]+1);
			}
	return dp[1][x][y];
}
#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...