Submission #316280

#	Time	Username	Problem	Language	Result	Execution time	Memory
316280		lauran	Jelly Flavours (IOI20_jelly)	C++14	35 / 100	2089 ms	413048 KiB

jelly

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

int dp[205][505][505];

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 = 1; i <= n; i++) {
            for (int xx = 0; xx <= x; xx++) {
                for (int yy = 0; yy <= y; yy++) {
                    dp[i][xx][yy] = dp[i - 1][xx][yy];
                    if (xx >= a[i - 1])
                        dp[i][xx][yy] = max(dp[i][xx][yy], dp[i - 1][xx - a[i - 1]][yy] + 1);
                    if (yy >= b[i - 1])
                        dp[i][xx][yy] = max(dp[i][xx][yy], dp[i - 1][xx][yy - b[i - 1]] + 1);
                }
            }
        }
        int ans = dp[n][0][0];
        for (int xx = 0; xx <= x; xx++)
            for (int yy = 0; yy <= y; yy++)
                ans = max(ans, dp[n][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:28:1: warning: control reaches end of non-void function [-Wreturn-type]
   28 | }
      | ^

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