제출 #1169078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1169078		mateuszwes	Jelly Flavours (IOI20_jelly)	C++20	35 / 100	527 ms	197040 KiB

jelly

#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pii pair<int,int>
#define pl pair<ll,ll>
#define F first
#define S second
#define pq priority_queue
#define all(x) x.begin(), x.end()
#define deb(x) cout << #x << " = " << x << '\n';
#define deb2(x,y) cout << #x << " = " << x << ", " << #y << " = " << y << '\n';

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();
	if(x <= 500 && y <= 500 && n <= 200){
		int dp[x+7][y+7][n+7];

		for(int x1 = 0; x1 <= x; x1++){
			for(int y1 = 0; y1 <= y; y1++){
				dp[x1][y1][0] = 0;
			}
		}

		for(int x1 = 0; x1 <= x; x1++){
			for(int y1 = 0; y1 <= y; y1++){
				for(int i = 1; i <= n; i++){
					dp[x1][y1][i] = dp[x1][y1][i-1];
					if(x1 >= a[i-1]) dp[x1][y1][i] = max(dp[x1][y1][i], dp[x1-a[i-1]][y1][i-1]+1);
					if(y1 >= b[i-1]) dp[x1][y1][i] = max(dp[x1][y1][i], dp[x1][y1-b[i-1]][i-1]+1);
				}
			}
		}
		return dp[x][y][n];

	}

	

	return n;
}

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