Submission #1175935

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175935		DanielPr8	Uplifting Excursion (BOI22_vault)	C++20	5 / 100	1080 ms	589824 KiB

vault

#include <bits/stdc++.h>
using namespace std;
using ll = __int128_t;
using pp = long long;
using vll = vector<ll>;
using vvl = vector<vll>;
using vb = vector<bool>;
using pll = pair<ll,ll>;
using vpl = vector<pll>;
using vvp = vector<vpl>;
using vi = vector<int>;
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define pb push_back


int main(){
    ios_base::sync_with_stdio(0);cin.tie(NULL);
    pp n, l, z, q;
    ll s1 = 0, s2=0, a1=0, a2 = 0;
    cin >> n >> l;
    vll ng(n),ps(n);
    for(ll i = n; i > 0; --i){cin >> q;ng[i-1]=q;a2+=ng[i-1];s2+=ng[i-1]*i;}
    cin >> z;
    for(ll i = 1; i <= n; ++i){cin >> q;ps[i-1]=q;a1+=ps[i-1];s1+=ps[i-1]*i;}

    if(l>s1 || -s2>l){cout << "impossible";return 0;}
    vvl kn(n+1, vll(s1+s2+1, -1e18));
    kn[0][s2]=0;
    for(ll i = 0; i < n; ++i){
        for(ll j = 0; j <= s1+s2; ++j){
            kn[i+1][j]=-1e18;
            for(ll h = 0; h <= ps[i] && j>=h*(i+1); ++h){
                kn[i+1][j] = max(kn[i+1][j], kn[i][j-(i+1)*h]+h);
            }
        }
    }
    reverse(all(kn));
    for(ll i = 0; i < n; ++i){
        for(ll j = 0; j <= s1+s2; ++j){
            kn[i+1][j]=-1e18;
            for(ll h = 0; h <= ng[i] && j+h*(i+1)<=s1+s2; ++h){
                kn[i+1][j] = max(kn[i+1][j], kn[i][j+(i+1)*h]+h);
            }
        }
    }
    if(kn[n][l+s2]<0)cout << "impossible";
    else cout << pp(kn[n][l+s2]+z);
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10