Submission #653561

#	Time	Username	Problem	Language	Result	Execution time	Memory
653561		atigun	Uplifting Excursion (BOI22_vault)	C++14	0 / 100	5067 ms	32096 KiB

vault

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 100;

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+1)/2*maxn;
  vector<ll> knapsack1(maxn3+5, -1e18), knapsack2(maxn3+5, -1e18);
  set<int> S;
  knapsack1[0] = knapsack2[0] = 0;
  S.insert(0);
  for(int i = 1; i <= M; i++){
    set<int> news;
    for(auto it = S.rbegin(); it != S.rend(); it++){
      int val = *it;
      for(int use = 1; use <= max(pos[i], neg[i]); use++){
        if(val+use*i <= maxn3 && use <= pos[i] && knapsack1[val] != -1e18){
          knapsack1[val+use*i] = max(knapsack1[val+use*i], knapsack1[val]+use);
          news.insert(val+use*i);
        }
        if(val+use*i <= maxn3 && use <= neg[i] && knapsack2[val] != -1e18){
          knapsack2[val+use*i] = max(knapsack2[val+use*i], knapsack2[val]+use);
          news.insert(val+use*i);
        }
      }
    }
    for(int i : news)
      S.insert(i);
  }
  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: 0 / 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