Submission #1312003

#TimeUsernameProblemLanguageResultExecution timeMemory
1312003norrawichzzzJelly Flavours (IOI20_jelly)C++20
0 / 100
2097 ms50988 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(x+5, vector<int>(y+5)); dp[0][0] = 0; for (int e=0; e<n; e++) { for (int i=x; i>=0; i--) { for (int j=y; j>=0; j--) { if (i-a[e] >= 0) dp[i][j] = max(dp[i-a[e]][j]+1, dp[i][j]); if (j-b[e] >= 0) dp[i][j] = max(dp[i][j-b[e]]+1, dp[i][j]); } } } for (int i=0; i<=min(x,y); i++) cout<< dp[i][i]<< '\n'; return dp[x][y]; } /* int main() { int n,x,y; cin>> n>> x>> y; vector<int> a(n), b(n); for (int i=0; i<n; i++) cin>> a[i]; for (int i=0; i<n; i++) cin>> b[i]; cout<< find_maximum_unique(x, y, a, b); }*/
#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...