| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1304220 | Zone_zonee | Jelly Flavours (IOI20_jelly) | C++20 | 23 ms | 516 KiB |
#include "jelly.h"
#include <vector>
#include <cstring>
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
const int N = 2e3+10, M = 1e4+10;
int ans = 0;
int dp1[2*M];
memset(dp1, 0, sizeof dp1);
int n = a.size();
for(int i = 0; i < n; ++i){
for(int j = x+y; j >= a[i]; --j){
dp1[j] = std::max(dp1[j], dp1[j-a[i]]+1);
}
}
return dp1[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... | ||||
