Submission #624221

#TimeUsernameProblemLanguageResultExecution timeMemory
624221MatesV13Jelly Flavours (IOI20_jelly)C++17
0 / 100
1 ms340 KiB
#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 = sizeof(a)/sizeof(a[0]);
	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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...