제출 #983692

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983692		Sofiatpc	Jelly Flavours (IOI20_jelly)	C++14	14 / 100	1 ms	600 KiB

jelly

#include "jelly.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2005, MAX = 1e4+5;
int dp[MAXN][MAX];

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

	sort(a.begin(),a.end());
	int l = 1, r = n;
	while(l!=r){
		int mid = (l+r+1)/2;
		int curx = x, cury = y;
		for(int i = mid-1; i >= 0; i--){
			if(curx > cury)curx -= a[i];
			else cury -= a[i];
		}
		if(curx >= 0 && cury >= 0)l = mid;
		else r = mid-1;
	}

	int curx = x, cury = y;
	for(int i = l-1; i >= 0; i--){
		if(curx > cury)curx -= a[i];
		else cury -= a[i];
	}
	if(curx >= 0 && cury >= 0) return l;
	return 0;
}

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