# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
694072 | finn__ | Uplifting Excursion (BOI22_vault) | C++17 | 1 ms | 212 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>
using namespace std;
int main()
{
int64_t m, l;
cin >> m >> l;
vector<uint64_t> dp1(2 * m * m * m, 0), dp2(2 * m * m * m, 0);
vector<unsigned> q;
q.push_back(m * m * m);
for (int64_t i = -m; i <= m; i++)
{
int64_t a;
cin >> a;
vector<unsigned> y;
for (unsigned const &j : q)
{
for (size_t k = 1; k <= a; k++)
{
if (dp2[j + k * i] < dp1[j] + k)
{
dp2[j + k * i] = dp1[j] + k;
y.push_back(j + k * i);
}
y.push_back(j);
}
}
swap(y, q);
sort(q.begin(), q.end());
q.resize(unique(q.begin(), q.end()) - q.begin());
swap(dp1, dp2);
}
if (m * m * m + l < dp1.size() && dp1[m * m * m + l])
cout << dp1[m * m * m + l] << '\n';
else
cout << "impossible\n";
}
Compilation message (stderr)
# | 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... |