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>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int m;
ll L;
cin >> m >> L;
vector<ll> a(m + 1);
for (int i = -m; i <= m; i++) {
if (i < 0) cin >> *new ll;
else cin >> a[i];
}
ll lim = 5000, ans = 0;
for (int i = 0; i <= m; i++) {
ll t = max(0LL, min(a[i], !i ? LLONG_MAX : (L - lim) / i));
ans += t, L -= i * t, a[i] -= t;
}
L = min(L, lim + m);
vector<ll> f(L + 1, -1e18);
f[0] = 0;
for (int i = 1; i <= m; i++) {
vector<ll> g(L + 1, -1e18);
for (int j = 0; j <= L; j++) {
for (int k = 0; k <= a[i] && j + i * k <= L; k++) {
g[j + i * k] = max(g[j + i * k], f[j] + k);
}
}
swap(f, g);
}
if (f[L] < 0) cout << "impossible\n";
else cout << ans + f[L] << "\n";
return 0;
}
# | 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... |
# | 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... |