| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1304215 | Zone_zonee | Jelly Flavours (IOI20_jelly) | C++20 | 66 ms | 1420 KiB |
#include "jelly.h"
#include <vector>
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
const int N = 2e3+10, M = 5e2+10;
int dp[M][M] = {};
int n = a.size();
for(int i = 1; i <= n; ++i){
for(int j = x; j >= 0; --j){
for(int k = y; k >= 0; --k){
if(j >= a[i-1]) dp[j][k] = std::max(dp[j][k], dp[j-a[i-1]][k]+1);
if(k >= b[i-1]) dp[j][k] = std::max(dp[j][k], dp[j][k-b[i-1]]+1);
}
}
}
return dp[x][y];
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
