제출 #1342866

#제출 시각아이디문제언어결과실행 시간메모리
1342866WarinchaiJelly Flavours (IOI20_jelly)C++20
0 / 100
2 ms2372 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...