Submission #1231565

#TimeUsernameProblemLanguageResultExecution timeMemory
1231565mayacJelly Flavours (IOI20_jelly)C++20
10 / 100
66 ms76620 KiB
#include <bits/stdc++.h> using namespace std; int find_maximum_unique(int x, int y, vector<int> a, vector<int> b){ int n=a.size(); vector<vector<int>> dp(n+1,vector<int>(x+1,0)); for(int i=0;i<n;i++){ for(int pa=0;pa<=x;pa++){ dp[i+1][pa]=dp[i][pa]; if(a[i]<=pa){ dp[i+1][pa]=max(dp[i+1][pa],1+dp[i][pa-a[i]]); } } } return dp[n][x]+min(n-dp[n][x],y/b[0]); }
#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...