oj.uz

Submission #604637

# Submission time Handle Problem Language Result Execution time Memory
604637 2022-07-25T08:19:43 Z Plurm Uplifting Excursion (BOI22_vault) C++11
5 / 100
 5000 ms 14064 KB 
#include <bits/stdc++.h>
using namespace std;

template <typename T> class negarr {
private:
  T data[505000 * 2 + 1];

public:
  negarr() { memset(data, 0, sizeof(data)); }
  void reset() { fill(data, data + 505000 * 2 + 1, -1000000000); }
  inline T &operator[](int i) { return data[i + 505000]; }
};

class pstate {
public:
  int x, y;
  pstate(int x, int y) : x(x), y(y) {}
  friend bool operator<(const pstate &a, const pstate &b) {
    return a.x + a.y < b.x + b.y;
  }
};
class nstate {
public:
  int x, y;
  nstate(int x, int y) : x(x), y(y) {}
  friend bool operator<(const nstate &a, const nstate &b) {
    return a.y - a.x < b.y - b.x;
  }
};
negarr<int> a, knapsack;
int main() {
  int m;
  long long l;
  cin >> m >> l;
  const int BOUND = m * (m + 1) / 2 * 100;
  if (l > BOUND || l < -BOUND) {
    printf("impossible\n");
    return 0;
  }
  knapsack.reset();
  knapsack[0] = 0;
  for (int i = -m; i <= m; i++) {
    cin >> a[i];
    negarr<int> tmp;
    tmp.reset();
    if (i == 0) {
      for (int id = -BOUND; id <= BOUND; id++) {
        knapsack[id] += a[i];
      }
    } else {
      if (i > 0) {
        vector<vector<nstate>> pq(i);
        for (int id = -BOUND; id <= BOUND; id++) {
          int mod = id % i;
          if (mod < 0)
            mod += i;
          pq[mod].reserve(2 * BOUND / i + 5);
        }
        for (int id = -BOUND; id <= BOUND; id++) {
          int mod = id % i;
          if (mod < 0)
            mod += i;
          int xx = (id + BOUND) / i;
          while (!pq[mod].empty() && xx - pq[mod].front().x > a[i]) {
            pop_heap(pq[mod].begin(), pq[mod].end());
            pq[mod].pop_back();
          }
          while (!pq[mod].empty() &&
                 pq[mod].front() < nstate(xx, knapsack[id])) {
            pop_heap(pq[mod].begin(), pq[mod].end());
            pq[mod].pop_back();
          }
          pq[mod].push_back({xx, knapsack[id]});
          push_heap(pq[mod].begin(), pq[mod].end());
          if (!pq[mod].empty()) {
            nstate t = pq[mod].front();
            tmp[id] = max(tmp[id], t.y - t.x + xx);
          }
        }
      } else if (i < 0) {
        vector<vector<pstate>> pq(-i);
        for (int id = -BOUND; id <= BOUND; id++) {
          int mod = id % (-i);
          if (mod < 0)
            mod += (-i);
          pq[mod].reserve(2 * BOUND / (-i) + 5);
        }
        for (int id = BOUND; id >= -BOUND; id--) {
          int mod = id % (-i);
          if (mod < 0)
            mod += (-i);
          int xx = (id + BOUND) / (-i);
          while (!pq[mod].empty() && pq[mod].front().x - xx > a[i]) {
            pop_heap(pq[mod].begin(), pq[mod].end());
            pq[mod].pop_back();
          }
          while (!pq[mod].empty() &&
                 pq[mod].front() < pstate(xx, knapsack[id])) {
            pop_heap(pq[mod].begin(), pq[mod].end());
            pq[mod].pop_back();
          }
          pq[mod].push_back({xx, knapsack[id]});
          push_heap(pq[mod].begin(), pq[mod].end());
          if (!pq[mod].empty()) {
            pstate t = pq[mod].front();
            knapsack[id] = max(knapsack[id], t.y + t.x - xx);
          }
        }
      }
      for (int id = -BOUND; id <= BOUND; id++) {
        knapsack[id] = max(knapsack[id], tmp[id]);
      }
    }
  }
  if (knapsack[l] >= 0)
    printf("%d\n", knapsack[l]);
  else
    printf("impossible\n");
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 7 ms 12116 KB Output is correct
4 Correct 32 ms 12116 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 1554 ms 13884 KB Output is correct
7 Correct 1150 ms 14064 KB Output is correct
8 Correct 1561 ms 13936 KB Output is correct
9 Correct 1774 ms 13912 KB Output is correct
10 Correct 880 ms 13856 KB Output is correct
11 Correct 903 ms 13920 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 7 ms 12116 KB Output is correct
4 Correct 32 ms 12116 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 1554 ms 13884 KB Output is correct
7 Correct 1150 ms 14064 KB Output is correct
8 Correct 1561 ms 13936 KB Output is correct
9 Correct 1774 ms 13912 KB Output is correct
10 Correct 880 ms 13856 KB Output is correct
11 Correct 903 ms 13920 KB Output is correct
12 Correct 8 ms 12116 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 26 ms 12228 KB Output is correct
16 Correct 8 ms 12116 KB Output is correct
17 Correct 1596 ms 13920 KB Output is correct
18 Correct 1143 ms 13924 KB Output is correct
19 Correct 1529 ms 13860 KB Output is correct
20 Correct 1692 ms 13992 KB Output is correct
21 Correct 876 ms 13876 KB Output is correct
22 Correct 819 ms 13876 KB Output is correct
23 Correct 5 ms 12116 KB Output is correct
24 Execution timed out 5087 ms 12804 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 7 ms 12116 KB Output is correct
4 Correct 32 ms 12116 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 1554 ms 13884 KB Output is correct
7 Correct 1150 ms 14064 KB Output is correct
8 Correct 1561 ms 13936 KB Output is correct
9 Correct 1774 ms 13912 KB Output is correct
10 Correct 880 ms 13856 KB Output is correct
11 Correct 903 ms 13920 KB Output is correct
12 Correct 23 ms 12116 KB Output is correct
13 Incorrect 5 ms 12116 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 7 ms 12116 KB Output is correct
4 Correct 32 ms 12116 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 1554 ms 13884 KB Output is correct
7 Correct 1150 ms 14064 KB Output is correct
8 Correct 1561 ms 13936 KB Output is correct
9 Correct 1774 ms 13912 KB Output is correct
10 Correct 880 ms 13856 KB Output is correct
11 Correct 903 ms 13920 KB Output is correct
12 Correct 8 ms 12116 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 26 ms 12228 KB Output is correct
16 Correct 8 ms 12116 KB Output is correct
17 Correct 1596 ms 13920 KB Output is correct
18 Correct 1143 ms 13924 KB Output is correct
19 Correct 1529 ms 13860 KB Output is correct
20 Correct 1692 ms 13992 KB Output is correct
21 Correct 876 ms 13876 KB Output is correct
22 Correct 819 ms 13876 KB Output is correct
23 Correct 5 ms 12116 KB Output is correct
24 Execution timed out 5087 ms 12804 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12116 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 7 ms 12116 KB Output is correct
4 Correct 32 ms 12116 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 1554 ms 13884 KB Output is correct
7 Correct 1150 ms 14064 KB Output is correct
8 Correct 1561 ms 13936 KB Output is correct
9 Correct 1774 ms 13912 KB Output is correct
10 Correct 880 ms 13856 KB Output is correct
11 Correct 903 ms 13920 KB Output is correct
12 Correct 8 ms 12116 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 26 ms 12228 KB Output is correct
16 Correct 8 ms 12116 KB Output is correct
17 Correct 1596 ms 13920 KB Output is correct
18 Correct 1143 ms 13924 KB Output is correct
19 Correct 1529 ms 13860 KB Output is correct
20 Correct 1692 ms 13992 KB Output is correct
21 Correct 876 ms 13876 KB Output is correct
22 Correct 819 ms 13876 KB Output is correct
23 Correct 5 ms 12116 KB Output is correct
24 Execution timed out 5087 ms 12804 KB Time limit exceeded
25 Halted 0 ms 0 KB -