제출 #673033

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

jelly

#include <bits/stdc++.h>
#include "jelly.h"
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int MAX = 2005;
int n, a[MAX], b[MAX];

int find_maximum_unique(int x, int y, vector<int> _a, vector<int> _b) {
	n = _a.size();
	
	bool aux = true;

	for(int i = 1; i <= n; i++){
		a[i] = _a[i - 1];
		b[i] = _b[i - 1];

		aux &= (a[i] == b[i]);
	}

	assert(aux);

	if(aux){ x += y; y = 0; }

	vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(x + 1, vector<int>(y + 1, 0)));

	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= x; j++){
			for(int k = 0; k <= y; k++){
				int cur = dp[i - 1][j][k];

				if(j >= a[i]) cur = max(cur, dp[i - 1][j - a[i]][k] + 1);
				if(k >= b[i]) cur = max(cur, dp[i - 1][j][k - b[i]] + 1);

				dp[i][j][k] = cur;
			}
		}
	}

	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