제출 #624225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
624225		MatesV13	Jelly Flavours (IOI20_jelly)	C++17	11 / 100	2086 ms	340 KiB

jelly

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

int find_maximum_unique(int x, int y, vector<int, allocator<int> >  a, vector<int, allocator<int> > b){
	
	int maks = 0; int n = a.size();
//	cout << n << endl;
	for (int i=0; i<pow(3, n); i++){
		int tempi = i;
		int tempx = x;
		int tempy = y;
		int br=0;
		
		for (int j=0; j<n; j++){
			if (tempi%3){
				if (tempi%3==1) tempx -= a[j];
				else tempy -= b[j];
				br++;
			} tempi /= 3;
		}
		
		if (tempx >= 0 and tempy >= 0)
			maks = max(maks, br); 
	}
	
	return maks;
}

//int main(){
//	cout << find_maximum_unique(2, 3, vector<int>{2, 1, 4}, vector<int>{2, 3, 2}) << endl;
//	cout << find_maximum_unique(6, 12, [5, 1, 5, 6, 3], [3, 5, 4, 6, 7]) << endl;
//}

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