Submission #1342866

#	Time	Username	Problem	Language	Result	Execution time	Memory
1342866		Warinchai	Jelly Flavours (IOI20_jelly)	C++20	0 / 100	2 ms	2372 KiB

jelly

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

int dp[2][505][505];

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

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