Submission #1355613

#	Time	Username	Problem	Language	Result	Execution time	Memory
1355613		ramzialoulou	Uplifting Excursion (BOI22_vault)	C++20	5 / 100	5095 ms	159860 KiB

vault

#include <bits/stdc++.h>

using namespace std;

const int N = int(1e5) + 9;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int m;
  cin >> m;
  long long L;
  cin >> L;
  vector<int> a(2 * m + 1);
  for (int i = -m; i <= m; i++) {
    cin >> a[i + m];
  }
  vector dp(2 * m + 2, vector<int>(2 * N + 1, -1));
  dp[0][N] = 0;
  for (int i = -m; i <= m; i++) {
    for (int x = -N; x <= N; x++) {
      if (dp[i + m][x + N] == -1) continue;
      for (int j = 0; j <= a[i + m]; j++) {
        int k = x + i * j;
        if (-N <= k && k <= N) {
          k += N;
          dp[i + 1 + m][k] = max(dp[i + 1 + m][k], dp[i + m][x + N] + j);
        }
      }
    }
  }
  L += N;
  if (0 <= L && L <= 2 * N) {
    if (dp[2 * m + 1][L] == -1) {
      cout << "impossible" << '\n';
    } else {
      cout << dp[2 * m + 1][L] << '\n';
    }
  } else {
    cout << "impossible" << '\n';
  }
  return 0;
}

• 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