# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406450 | victoriad | Jelly Flavours (IOI20_jelly) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "jelly.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;
int maxi(int x, int y, std::vector<int> a, std::vector<int> b,int nodo,int r){
if(nodo=a.size()){
return r;
}
else{
if(a[nodo]<=x && b[nodo]<=y){
return max(maxi(x-a[nodo],y,a,b,nodo+1,r+1),maxi(x,y-b[nodo],a,b,nodo+1,r+1),maxi(x,y,a,b,nodo+1,r));
}
else if(a[nodo]<=x){
return max(maxi(x-a[nodo],y,a,b,nodo+1,r+1),maxi(x,y,a,b,nodo+1,r));
}
else if(b[nodo]<=y){
return max(maxi(x,y-b[nodo],a,b,nodo+1,r+1),maxi(x,y,a,b,nodo+1,r));
}
else{
return r;
}
}
}
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
int n = a.size();
return maxi(x,y,a,b,0,0);
}