| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327338 | jump | Jelly Flavours (IOI20_jelly) | C++20 | 18 ms | 496 KiB |
#include<bits/stdc++.h>
int dp[10010];
//least x spent with y(i) spent
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
std::vector<std::pair<int,int>> comb;
for(int i=0;i<a.size();i++){
comb.push_back({a[i],b[i]});
}
std::sort(comb.begin(),comb.end());
int jelly=0;
for(auto [ca,cb]:comb){
for(int i=0;i<=10000;i++){
dp[i]=dp[i]+ca;
if(ca>=i)
dp[i]=std::min(dp[i],dp[i-cb]);
}
bool pos=false;
for(int i=0;i<=y;i++){
if(dp[i]<=x)pos=true;
}
if(!pos)break;
jelly+=1;
}
return jelly;
}
| # | 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... | ||||
