Submission #792069

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
792069	2023-07-24 14:42:59	ToniB	Uplifting Excursion (BOI22_vault)	C++17	5 / 100	4306 ms	255220 KiB

vault

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 805;
const int K = MAXN * MAXN / 4;
int m, a[MAXN];
int dp[MAXN][MAXN * MAXN / 2];
long long L;
int main(){
  cin >> m >> L;
  for(int i = 0; i < 2 * m + 1; ++i) cin >> a[i];
  for(int i = 0; i < 2 * m + 1; ++i){
    // dp[i][j] = max{dp[i - 1][j - x * (i - m)] + x}
    for(int j = 0; j < MAXN * MAXN / 2; ++j){
      dp[i][j] = -1e9;
      for(int x = 0; x <= a[i]; ++x){
        if(j - x * (i - m) >= 0 && j - x * (i - m) < MAXN * MAXN / 2){
          if(i) dp[i][j] = max(dp[i][j], dp[i - 1][j - x * (i - m)] + x);
          else if(j - x * (i - m) == K) dp[i][j] = max(dp[i][j], x);
        }
      }
    }
  }
  if(L + K < 0 || L + K >= MAXN * MAXN / 2) cout << "impossible\n";
  else if(dp[2 * m][L + K] < 0) cout << "impossible\n";
  else cout << dp[2 * m][L + K];
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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