Submission #316273

#	Time	Username	Problem	Language	Result	Execution time	Memory
316273		lauran	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	111 ms	131576 KiB

jelly

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

int find_maximum_unique(int x, int y, vector <int> a, vector <int> b) {
    int n = a.size();
    if (x <= 500 && y <= 500 && n <= 200) {
        // subtask 1, 2
        int dp[n + 10][x + 10][y + 10] = {0};
        for (int i = 0; i < n; i++) {
            for (int xx = 0; xx <= x; xx++)
                for (int yy = 0; yy <= y; yy++) {
                    if (i > 0)
                        dp[i][xx][yy] = dp[i - 1][xx][yy];
                    if (xx >= a[i] && i > 0)
                        dp[i][xx][yy] = max(dp[i][xx][yy], dp[i - 1][xx - a[i]][yy] + 1);
                    if (yy >= b[i] && i > 0)
                        dp[i][xx][yy] = max(dp[i][xx][yy], dp[i - 1][xx][yy - b[i]] + 1);
                }
        }
        int ans = dp[n - 1][0][0];
        for (int xx = 0; xx <= x; xx++)
            for (int yy = 0; yy <= y; yy++)
                ans = max(ans, dp[n - 1][xx][yy]);
        return ans;
    }
}

Compilation message (stderr)

jelly.cpp: In function 'int find_maximum_unique(int, int, std::vector<int>, std::vector<int>)':
jelly.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
   27 | }
      | ^

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