제출 #1325029

#제출 시각아이디문제언어결과실행 시간메모리
1325029kasamchiJelly Flavours (IOI20_jelly)C++20
0 / 100
2 ms2104 KiB
#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;

#define INF 1000000000

int dp[2][501][501];

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