Submission #1169216

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169216		pythontest	Jelly Flavours (IOI20_jelly)	C++20	54 / 100	2057 ms	79036 KiB

jelly

#include "jelly.h"
#include <vector>
constexpr int X=1e3+3;
constexpr int N=2e3;
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();
    bool is=true;
    for(int i=0;i<n-1;i++) if(b[i]!=b[i+1]) is=false;
    int ycp = y;
    if(is) y=0;
    std::vector<std::vector<int>> dp1(x+1,std::vector<int>(y+1,0)), dp2(x+1,std::vector<int>(y+1,0));
    for(int i=0;i<n;i++){
        for(int c1=0;c1<=x;c1++)
            for(int c2=0;c2<=y;c2++){
                dp1[c1][c2]=dp2[c1][c2];
                if(c2-b[i]>=0) dp1[c1][c2]=std::max(dp1[c1][c2],dp2[c1][c2-b[i]]+1);
                if(c1-a[i]>=0) dp1[c1][c2]=std::max(dp1[c1][c2],dp2[c1-a[i]][c2]+1);
            }
        std::swap(dp1,dp2);
    }
    int res = dp2[x][y];
    if(is) res+=ycp/b[0];
	return std::min(n,res);
}

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