Submission #1229419

#TimeUsernameProblemLanguageResultExecution timeMemory
1229419maya_sJelly Flavours (IOI20_jelly)C++20
0 / 100
46 ms77128 KiB
#include <bits/stdc++.h> using namespace std; typedef int ll; ll dp[2001][10001]; int find_maximum_unique(int x, int y, vector<int> A, vector<int> B) { ll n = A.size(); vector<ll> a(n+1), b(n+1); for(ll i = 0; i < n; i++) a[i+1] =+ A[i], b[i+1] = B[i]; for(ll i = 1; i <= n; i++){ for(ll sum_a = 0; sum_a <= x; sum_a++){ dp[i][sum_a] = dp[i-1][sum_a]; if(sum_a - a[i] >= 0) dp[i][sum_a] = max(dp[i][sum_a], dp[i-1][sum_a - a[i]] + 1); } } return dp[n][x]; }
#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...