Submission #1169227

#TimeUsernameProblemLanguageResultExecution timeMemory
1169227Szymon_PilipczukJelly Flavours (IOI20_jelly)C++20
11 / 100
2096 ms456 KiB
#include <bits/stdc++.h> using namespace std; int find_maximum_unique(int x,int y,vector<int> a,vector<int> b) { int tans = 0; for(int i = 0;i<(1<<a.size());i++) { vector<int> p; int ans = 0; int myx = 0; int ci = i; int q =0; for(int u = 0;u<a.size();u++) { if(ci%2) { myx += a[q]; ans++; } else { p.push_back(b[q]); } q++; ci/=2; } if(myx <= x) { int myy = y; sort(p.begin(),p.end()); for(int j = 0;j<p.size();j++) { if(myy >= p[j]) { ans++; myy-=p[j]; } } tans = max(ans,tans); } } return tans; }
#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...