oj.uz

답안 #653530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653530 2022-10-27T08:30:21 Z atigun Uplifting Excursion (BOI22_vault) C++14
0 / 100
 5000 ms 15972 KB 
#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*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] = 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] = 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;
    if(need == 0)
      add = max(add, knapsack1[i]);
    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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 15972 KB Output is correct
2 Correct 20 ms 15956 KB Output is correct
3 Correct 19 ms 15968 KB Output is correct
4 Correct 121 ms 15948 KB Output is correct
5 Execution timed out 5096 ms 15948 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 15972 KB Output is correct
2 Correct 20 ms 15956 KB Output is correct
3 Correct 19 ms 15968 KB Output is correct
4 Correct 121 ms 15948 KB Output is correct
5 Execution timed out 5096 ms 15948 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 15956 KB Output is correct
2 Execution timed out 5089 ms 8148 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 15956 KB Output is correct
2 Execution timed out 5089 ms 8148 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 15956 KB Output is correct
2 Execution timed out 5089 ms 8148 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 15972 KB Output is correct
2 Correct 20 ms 15956 KB Output is correct
3 Correct 19 ms 15968 KB Output is correct
4 Correct 121 ms 15948 KB Output is correct
5 Execution timed out 5096 ms 15948 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 15956 KB Output is correct
2 Execution timed out 5089 ms 8148 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 15972 KB Output is correct
2 Correct 20 ms 15956 KB Output is correct
3 Correct 19 ms 15968 KB Output is correct
4 Correct 121 ms 15948 KB Output is correct
5 Execution timed out 5096 ms 15948 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 15956 KB Output is correct
2 Execution timed out 5089 ms 8148 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 15972 KB Output is correct
2 Correct 20 ms 15956 KB Output is correct
3 Correct 19 ms 15968 KB Output is correct
4 Correct 121 ms 15948 KB Output is correct
5 Execution timed out 5096 ms 15948 KB Time limit exceeded
6 Halted 0 ms 0 KB -