oj.uz

Submission #604648

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

template <typename T> class negarr {
private:
  vector<T> data;
  int n;

public:
  negarr(int n) : n(n) { data.resize(2 * n + 1, 0); }
  void reset() { fill(data.begin(), data.end(), -1000000000); }
  inline T &operator[](int i) { return data[i + n]; }
};

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;
  }
};
int main() {
  int m;
  long long l;
  cin >> m >> l;
  const int BOUND = m * (m + 1) / 2 * 100;
  negarr<int> a(m), knapsack(BOUND);
  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];
    if (i == 0) {
      for (int id = -BOUND; id <= BOUND; id++) {
        knapsack[id] += a[i];
      }
    } else {
      negarr<int> tmp(BOUND);
      tmp.reset();
      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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1474 ms 4056 KB Output is correct
7 Correct 1062 ms 4104 KB Output is correct
8 Correct 1437 ms 4196 KB Output is correct
9 Correct 1570 ms 4100 KB Output is correct
10 Correct 806 ms 4108 KB Output is correct
11 Correct 785 ms 4148 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1474 ms 4056 KB Output is correct
7 Correct 1062 ms 4104 KB Output is correct
8 Correct 1437 ms 4196 KB Output is correct
9 Correct 1570 ms 4100 KB Output is correct
10 Correct 806 ms 4108 KB Output is correct
11 Correct 785 ms 4148 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 10 ms 456 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 1424 ms 4144 KB Output is correct
18 Correct 1095 ms 4128 KB Output is correct
19 Correct 1453 ms 4160 KB Output is correct
20 Correct 1563 ms 4184 KB Output is correct
21 Correct 807 ms 4144 KB Output is correct
22 Correct 824 ms 4192 KB Output is correct
23 Correct 3 ms 4180 KB Output is correct
24 Execution timed out 5077 ms 8776 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 340 KB Output is correct
2 Incorrect 1 ms 596 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 9 ms 340 KB Output is correct
2 Incorrect 1 ms 596 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 9 ms 340 KB Output is correct
2 Incorrect 1 ms 596 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1474 ms 4056 KB Output is correct
7 Correct 1062 ms 4104 KB Output is correct
8 Correct 1437 ms 4196 KB Output is correct
9 Correct 1570 ms 4100 KB Output is correct
10 Correct 806 ms 4108 KB Output is correct
11 Correct 785 ms 4148 KB Output is correct
12 Correct 9 ms 340 KB Output is correct
13 Incorrect 1 ms 596 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 9 ms 340 KB Output is correct
2 Incorrect 1 ms 596 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1474 ms 4056 KB Output is correct
7 Correct 1062 ms 4104 KB Output is correct
8 Correct 1437 ms 4196 KB Output is correct
9 Correct 1570 ms 4100 KB Output is correct
10 Correct 806 ms 4108 KB Output is correct
11 Correct 785 ms 4148 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 10 ms 456 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 1424 ms 4144 KB Output is correct
18 Correct 1095 ms 4128 KB Output is correct
19 Correct 1453 ms 4160 KB Output is correct
20 Correct 1563 ms 4184 KB Output is correct
21 Correct 807 ms 4144 KB Output is correct
22 Correct 824 ms 4192 KB Output is correct
23 Correct 3 ms 4180 KB Output is correct
24 Execution timed out 5077 ms 8776 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 340 KB Output is correct
2 Incorrect 1 ms 596 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1474 ms 4056 KB Output is correct
7 Correct 1062 ms 4104 KB Output is correct
8 Correct 1437 ms 4196 KB Output is correct
9 Correct 1570 ms 4100 KB Output is correct
10 Correct 806 ms 4108 KB Output is correct
11 Correct 785 ms 4148 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 10 ms 456 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 1424 ms 4144 KB Output is correct
18 Correct 1095 ms 4128 KB Output is correct
19 Correct 1453 ms 4160 KB Output is correct
20 Correct 1563 ms 4184 KB Output is correct
21 Correct 807 ms 4144 KB Output is correct
22 Correct 824 ms 4192 KB Output is correct
23 Correct 3 ms 4180 KB Output is correct
24 Execution timed out 5077 ms 8776 KB Time limit exceeded
25 Halted 0 ms 0 KB -