Submission #439466

#	Time	Username	Problem	Language	Result	Execution time	Memory
439466		jlallas384	Jelly Flavours (IOI20_jelly)	C++17	35 / 100	522 ms	2448 KiB

jelly

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

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
    int n = a.size();
    vector<vector<int>> dp(501,vector<int>(501,-1e9));
    dp[0][0] = 0;
    for(int i = 0; i < n; i++){
        for(int j = 500; j >= 0; j--){
            for(int k = 500; k >= 0; k--){
                if(j + a[i] <= x){
                    dp[j + a[i]][k] = max(dp[j + a[i]][k],dp[j][k] + 1);
                }
                if(k + b[i] <= y){
                    dp[j][k + b[i]] = max(dp[j][k + b[i]],dp[j][k] + 1);
                }
            }
        }
    }
    int ans = 0;
    for(auto v: dp){
        for(int i: v){
            ans = max(ans,i);
        }
    }
    return ans;
}

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