Submission #672908

#	Time	Username	Problem	Language	Result	Execution time	Memory
672908		mmk	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	642 ms	1046672 KiB

jelly

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

const int MAXN = 510;
const int INF = 0x3f3f3f3f;

int dp[MAXN][MAXN][MAXN];
int n, a[MAXN], b[MAXN];

int calc(int i, int x, int y)
{
    if(i == 0) return 0;
    if(dp[i][x][y] != 0) return dp[i][x][y];
    int uga, buga, duga;
    uga = 0;
    buga = 0;
    if(x >= a[i]) uga = calc(i-1,x-a[i],y);
    if (y >= b[i]) buga = calc(i-1, x, y - b[i]);
    duga = calc(i-1,x,y);
    return max(uga,max(buga,duga));
}
int find_maximum_unique(int _x, int _y, vector<int> _a, vector<int> _b)
{  
   n = _a.size();

   for(int i = 1; i <= n; i++){
      a[i] = _a[i - 1];
      b[i] = _b[i - 1];
   }

   memset(dp, -1, sizeof(dp));  
  
   cout << calc(n, _x, _y) << '\n';
}

Compilation message (stderr)

jelly.cpp: In function 'int find_maximum_unique(int, int, std::vector<int>, std::vector<int>)':
jelly.cpp:35:1: warning: no return statement in function returning non-void [-Wreturn-type]
   35 | }
      | ^

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