# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
612361 | KrisjanisP | Uplifting Excursion (BOI22_vault) | C++14 | 5120 ms | 464124 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>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using ll = long long;
const ll M = 100, A = 100;
ll m, l;
ll a[2*M+1];
bool dp_right_vis[M+1][M*M*A+1];
ll dp_right_res[M+1][M*M*A+1];
// i = [1;m]
ll dp_right(ll i, ll sum)
{
if(sum<0) return -1;
if(sum==0) return 0;
if(i==m+1) return -1;
if(dp_right_vis[i][sum])
return dp_right_res[i][sum];
ll res = -1;
for(ll j=min(sum/i,a[m+i]);j>=0;j--)
{
ll r = dp_right(i+1,sum-i*j);
if(r==-1) continue;
res = max(res,r+j);
# | 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... |