제출 #673238

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673238		Hacv16	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	18 ms	21204 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")
 
#define fr first
#define sc second

const int MAX = 2005;
const int INF = 0x3f3f3f3f;
 
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b){
	int n = a.size();
	
	vector<pair<int, int>> aux;

	for(int i = 0; i < n; i++)
		aux.emplace_back(a[i], b[i]);

	sort(aux.begin(), aux.end());

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

	dp[0][0] = {0, x};

	for(int i = 1; i <= y; i++)
        dp[0][i] = {-INF, -INF};

	int ans = 0;

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

			if(dp[i][j].sc >= a[i - 1])
				dp[i][j].fr++, dp[i][j].sc -= a[i - 1];

			if(j >= b[i - 1]){
				pair<int, int> cur = dp[i - 1][j - b[i - 1]]; cur.fr++;
				dp[i][j] = max(dp[i][j], cur);
			}

			ans = max(ans, dp[i][j].fr);
		}
	}
 
	return ans;
}

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