Submission #1092097

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1092097	2024-09-23 07:25:56	vjudge1	Uplifting Excursion (BOI22_vault)	C++14	100 / 100	1279 ms	4700 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
29
30
// BalticOI 2022 Day1 Uplifting Excursion
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  LL M, L;
  cin >> M >> L;
  vector<LL> A(2 * M + 1), C(2 * M + 1);
  for (LL i = 0; i <= 2 * M; i++) cin >> A[i];
  LL sum = 0;  // -M ... 0, 先把负的都算上
  for (LL i = 0; i <= M; i++) sum += A[i] * (i - M), C[i] = A[i];
  for (LL i = M + 1; i <= 2 * M; i++) {  // 再不超过L的前提下贪心选择正的
    C[i] = min((L - sum) / (i - M), A[i]), sum += C[i] * (i - M);
    assert(sum <= L);
  }
  for (LL i = 0; i < M; i++) {
    assert(sum <= L);
    LL c = min((L - sum) / (M - i), A[i]);
    sum += c * (M - i), C[i] -= c;
  }
  if (L - sum > M) return puts("impossible"), 0;
  LL cs = 0, wc = 0;
  const LL MIF = -4e18, B = M * M;
  vector<LL> W{0}, V{0};  // 二进制分组
  for (LL i = 0; i <= 2 * M; i++) {
    cs += C[i];  // 已有的数量
    if (i == M) continue;
    LL k = 1, s = min(A[i] - C[i], B), w = i - M;  // 增加物品
    while (k <= s) W.push_back(w * k), V.push_back(k), s -= k, k *= 2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3-1: 10 / 10
• Subtask 3-2: 10 / 10
• Subtask 4-1: 10 / 10
• Subtask 4-2: 10 / 10
• Subtask 5-1: 10 / 10
• Subtask 5-2: 10 / 10
• Subtask 6-1: 10 / 10
• Subtask 6-2: 10 / 10