제출 #1312003

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1312003		norrawichzzz	Jelly Flavours (IOI20_jelly)	C++20	0 / 100	2097 ms	50988 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(x+5, vector<int>(y+5));
    dp[0][0] = 0;

    
    for (int e=0; e<n; e++) {
        for (int i=x; i>=0; i--) {
            for (int j=y; j>=0; j--) {
                if (i-a[e] >= 0) dp[i][j] = max(dp[i-a[e]][j]+1, dp[i][j]);
                if (j-b[e] >= 0) dp[i][j] = max(dp[i][j-b[e]]+1, dp[i][j]);
            }
        }
    }
    for (int i=0; i<=min(x,y); i++) cout<< dp[i][i]<< '\n';
    return dp[x][y];
}
/*
int main() {
    int n,x,y;
    cin>> n>> x>> y;

    vector<int> a(n), b(n);
    for (int i=0; i<n; i++) cin>> a[i];
    for (int i=0; i<n; i++) cin>> b[i];  

    cout<< find_maximum_unique(x, y, a, b);
}*/

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