| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 655647 | zegna12 | Jelly Flavours (IOI20_jelly) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
typedef long long int ll; typedef long double ld; using namespace std; const ll mod = 1e9 + 7, inf = 1e18, maxn = 1e5;
int find_maximum_unique(int X, int Y, vector<int> a, vector<int> b) {
int N = X + 2 * Y, M = a.size() & 1;
for (auto& x : b)
x *= 2;
vector<vector<int>> dp(2, vector<int> (N + 1, 0));
for (int _ = 0; _ < a.size(); ++_) {
int x = a[_];
int y = b[_];
for (int j = N; j >= x; --j)
dp[_ & 1][j] = max(dp[_ & 1][j], dp[(_ & 1) ^ 1][j - x] + 1);
for (int j = N; j >= y; --j)
dp[_ & 1][j] = max(dp[_ & 1][j], dp[(_ & 1) ^ 1][j - y] + 1);
}
return *max_element(dp[M].begin(), dp[M].end());
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(20);
// freopen ("hps.in", "r", stdin);
// freopen ("hps.out", "w", stdout);
return 0;
}