Submission #624225

#TimeUsernameProblemLanguageResultExecution timeMemory
624225MatesV13Jelly Flavours (IOI20_jelly)C++17
11 / 100
2086 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 = 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; //}
#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...