| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1169208 | pythontest | Jelly Flavours (IOI20_jelly) | C++20 | 2099 ms | 101448 KiB |
#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();
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);
}
return dp2[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... | ||||
