oj.uz

Submission #669404

# Submission time Handle Problem Language Result Execution time Memory
669404 2022-12-06T11:19:46 Z erray Uplifting Excursion (BOI22_vault) C++17
50 / 100
 726 ms 596 KB 
// author: erray
#undef DEBUG 
#include <bits/stdc++.h>

#ifdef DEBUG
  #include "debug.h"
#else
  #define debug(...) void(37)
#endif

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int M;
  long long L;
  cin >> M >> L;
  vector<long long> neg(M), pos(M);
  long long banked = 0;
  for (int i = 0; i < M; ++i) {
    cin >> neg[M - i - 1];
  }
  cin >> banked;
  for (int i = 0; i < M; ++i) {
    cin >> pos[i];
  }
  if (L < 0) {
    swap(neg, pos);
    L = -L;
  }
  const int inf = int(1e9);
  vector<int> dp(M * M + 1, -inf);
  dp[0] = 0;
  auto Push = [&](int x, long long c, int delta) {
    bool rev = false;
    if (x < 0) {
      rev = true;
      x = -x;
      reverse(dp.begin(), dp.end());
    }
    for (int r = 0; r < x; ++r) {
      deque<pair<int, int>> dq;
      for (int i = r, ps = 0; i < int(dp.size()); i += x, ++ps) {
        int push = dp[i] + (ps * -delta);
        while (!dq.empty() && dq.back().first <= push) {
          dq.pop_back();
        }
        dq.emplace_back(push, ps);
        if (ps > c) {
          int rem = ps - c - 1;
          if (dq.front().second == rem) {
            dq.pop_front();
          }
        }
        dp[i] = dq.front().first + (delta * ps);
      } 
    }
    if (rev) {
      reverse(dp.begin(), dp.end());
    }
  };

  auto Value = [&](vector<long long> x) {
    long long res = 0;
    for (int i = 0; i < M; ++i) {
      res += (i + 1) * x[i];
    }
    return res;
  };
  if (Value(pos) - Value(neg) < L) {
    swap(pos, neg);
    L = -L;
  }
  debug(L, pos, neg);
  for (int i = 0; i < M; ++i) {
    L += (i + 1) * neg[i]; 
    banked += neg[i];
  }
  debug(L, banked);
  vector<long long> dec(M);
  for (int i = 0; i < M; ++i) {
    dec[i] = min(pos[i], L / (i + 1));
    L -= dec[i] * (i + 1);
    pos[i] -= dec[i];  
    banked += dec[i];
  }
  debug(pos, dec, L, banked);
  assert(L >= 0);
  for (int i = 0; i < M; ++i) {
    Push(i + 1, neg[i], -1);      
  }
  for (int i = 0; i < M; ++i) {
    Push(i + 1, pos[i], +1);
  }
  for (int i = 0; i < M; ++i) {
    Push(-(i + 1), dec[i], -1);
  }
  if (dp[L] == -inf) {
    cout << "impossible\n";
  } else {
    cout << banked + dp[L] << '\n';
  }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 4 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 4 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 212 KB Output is correct

Subtask #3-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 324 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 5 ms 420 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 5 ms 320 KB Output is correct
26 Correct 4 ms 320 KB Output is correct
27 Correct 4 ms 212 KB Output is correct
28 Correct 4 ms 324 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 4 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 5 ms 420 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 5 ms 320 KB Output is correct
26 Correct 4 ms 320 KB Output is correct
27 Correct 4 ms 212 KB Output is correct
28 Correct 4 ms 324 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 2 ms 320 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 2 ms 232 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 4 ms 328 KB Output is correct
40 Correct 4 ms 212 KB Output is correct
41 Correct 4 ms 212 KB Output is correct
42 Correct 4 ms 212 KB Output is correct
43 Correct 4 ms 212 KB Output is correct
44 Correct 4 ms 212 KB Output is correct
45 Correct 4 ms 212 KB Output is correct
46 Correct 4 ms 212 KB Output is correct
47 Correct 28 ms 340 KB Output is correct
48 Correct 29 ms 348 KB Output is correct
49 Correct 27 ms 340 KB Output is correct
50 Correct 27 ms 340 KB Output is correct
51 Correct 27 ms 340 KB Output is correct
52 Correct 26 ms 312 KB Output is correct
53 Correct 28 ms 320 KB Output is correct
54 Correct 27 ms 340 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 4 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 5 ms 420 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 5 ms 320 KB Output is correct
26 Correct 4 ms 320 KB Output is correct
27 Correct 4 ms 212 KB Output is correct
28 Correct 4 ms 324 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 2 ms 320 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 2 ms 232 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 4 ms 328 KB Output is correct
40 Correct 4 ms 212 KB Output is correct
41 Correct 4 ms 212 KB Output is correct
42 Correct 4 ms 212 KB Output is correct
43 Correct 4 ms 212 KB Output is correct
44 Correct 4 ms 212 KB Output is correct
45 Correct 4 ms 212 KB Output is correct
46 Correct 4 ms 212 KB Output is correct
47 Correct 28 ms 340 KB Output is correct
48 Correct 29 ms 348 KB Output is correct
49 Correct 27 ms 340 KB Output is correct
50 Correct 27 ms 340 KB Output is correct
51 Correct 27 ms 340 KB Output is correct
52 Correct 26 ms 312 KB Output is correct
53 Correct 28 ms 320 KB Output is correct
54 Correct 27 ms 340 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 2 ms 212 KB Output is correct
57 Correct 1 ms 316 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 2 ms 212 KB Output is correct
60 Correct 1 ms 324 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 2 ms 320 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 4 ms 212 KB Output is correct
66 Correct 4 ms 212 KB Output is correct
67 Correct 4 ms 316 KB Output is correct
68 Correct 4 ms 212 KB Output is correct
69 Correct 4 ms 212 KB Output is correct
70 Correct 4 ms 212 KB Output is correct
71 Correct 4 ms 212 KB Output is correct
72 Correct 4 ms 336 KB Output is correct
73 Correct 29 ms 460 KB Output is correct
74 Correct 28 ms 340 KB Output is correct
75 Correct 29 ms 344 KB Output is correct
76 Correct 27 ms 340 KB Output is correct
77 Correct 27 ms 340 KB Output is correct
78 Correct 28 ms 340 KB Output is correct
79 Correct 28 ms 340 KB Output is correct
80 Correct 28 ms 356 KB Output is correct
81 Correct 716 ms 596 KB Output is correct
82 Correct 723 ms 596 KB Output is correct
83 Correct 722 ms 596 KB Output is correct
84 Correct 699 ms 596 KB Output is correct
85 Correct 726 ms 596 KB Output is correct
86 Correct 716 ms 576 KB Output is correct
87 Correct 725 ms 596 KB Output is correct

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 4 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -