제출 #604359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
604359		Plurm	Uplifting Excursion (BOI22_vault)	C++11	0 / 100	5062 ms	3360 KiB

vault

#include <bits/stdc++.h>
using namespace std;

map<int, int> a, knapsack;
int main() {
  int m;
  long long l;
  cin >> m >> l;
  knapsack[0] = 0;
  for (int i = -m; i <= m; i++) {
    cin >> a[i];
    for (int rep = 0; rep < a[i]; rep++) {
      map<int, int> tmp;
      for (auto p : knapsack) {
        tmp[p.first + i] = max(tmp[p.first + i], p.second + 1);
      }
      for (auto p : tmp) {
        knapsack[p.first] = max(knapsack[p.first], p.second);
      }
    }
  }
  if (l >= 1e9)
    printf("impossible\n");
  else if (knapsack.count(l))
    printf("%d\n", knapsack[l]);
  else
    printf("impossible\n");
  return 0;
}

• 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