Submission #653545

#	Time	Username	Problem	Language	Result	Execution time	Memory
653545		atigun	Uplifting Excursion (BOI22_vault)	C++14	5 / 100	5061 ms	6936 KiB

vault

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 75;

int M;
ll L;

vector<int> pos(maxn+5), neg(maxn+5);

void solve(){
  cin >> M >> L;
  for(int i = 1; i <= M; i++)
    cin >> neg[M-i+1];
  ll ans;
  cin >> ans;
  for(int i = 1; i <= M; i++)
    cin >> pos[i];
  int maxn3 = maxn*maxn*maxn;
  vector<ll> knapsack1(maxn3+5, -1e18);
  knapsack1[0] = 0;
  for(int i = 1; i <= M; i++){
    for(int make = maxn3; make >= 0; make--){
      for(int use = 1; use <= pos[i] && use*1ll*i <= maxn3; use++){
        if(use*i <= make && knapsack1[make-use*i] != -1e18)
          knapsack1[make] = max(knapsack1[make], knapsack1[make-use*i]+use);
      }
    }
  }
  vector<ll> knapsack2(maxn3+5, -1e18);
  knapsack2[0] = 0;
  for(int i = 1; i <= M; i++){
    for(int make = maxn3; make >= 0; make--){
      for(int use = 1; use <= neg[i] && use*1ll*i <= maxn3; use++){
        if(use*i <= make && knapsack2[make-use*i] != -1e18)
          knapsack2[make] = max(knapsack2[make], knapsack2[make-use*i]+use);
      }
    }
  }
  ll add = -1e18;
  for(int i = 0; i <= maxn3; i++){
    ll need = L-i;
    if(need > 0){
      continue;
    }else if(need == 0){
      add = max(add, knapsack1[i]);
    }else if(-need >= maxn3 || knapsack2[-need] == -1e18 || knapsack1[i] == -1e18){
      continue;
    }else{
      add = max(add, knapsack1[i] + knapsack2[-need]);
    }
  }
  if(add == -1e18){
    cout << "impossible\n";
  }else{
    cout << ans+add;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  // cin >> tt;
  while(tt--){
    solve();
  }
}

• 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