oj.uz

Submission #798509

# Submission time Handle Problem Language Result Execution time Memory
798509 2023-07-30T19:20:00 Z jakobrs Radio Towers (IOI22_towers) C++17
56 / 100
 944 ms 24000 KB 
#include <optional>
#include <unordered_set>
#include <vector>
#include <algorithm>

#ifndef EVAL
#include <format>
#include <iostream>

template <typename... Args>
void print(std::format_string<Args...> fmt, Args &&...args) {
  std::cerr << std::format(fmt, std::forward<Args>(args)...);
}

template <typename... Args>
void println(std::format_string<Args...> fmt, Args &&...args) {
  std::cerr << std::format(fmt, std::forward<Args>(args)...) << '\n';
}
#else
template <typename... T> void print(T &&...args) {}
template <typename... T> void println(T &&...args) {}
#endif

int n;
std::vector<int> h;

void init(int N, std::vector<int> H) {
  n = N;
  h = H;
}

template <typename Node> struct SegmentTree {
  std::vector<Node> nodes;
  int offset;

  explicit SegmentTree(int sz) : nodes(2 * sz), offset(sz) {}

  void update(int idx, const Node &node) {
    idx += offset;
    nodes[idx] = node;

    while (idx /= 2) {
      nodes[idx] = nodes[2 * idx] * nodes[2 * idx + 1];
    }
  }

  Node query(int l, int r) const {
    Node left, right;

    l += offset;
    r += offset;

    while (l < r) {
      if (l & 1)
        left = left * nodes[l++];
      if (r & 1)
        right = nodes[--r] * right;

      l >>= 1;
      r >>= 1;
    }

    return left * right;
  }
};

int d;

struct LeftNode {
  int a, b, min, max;

  LeftNode() : a(-1), b(-1), min(2'000'000'000), max(-2'000'000'000) {}
  LeftNode(int a) : a(-1), b(-1), min(a), max(a) {}
  LeftNode(int a, int b, int min, int max) : a(a), b(b), min(min), max(max) {}

  LeftNode operator*(const LeftNode &rhs) const {
    std::pair<int, int> c1 = {b, a};
    std::pair<int, int> c2 = {rhs.b, rhs.a};
    std::pair<int, int> c3 = {-1, -1};
    if (rhs.max >= 0 && rhs.max - min >= d) {
      c3 = {rhs.max, min};
    }

    std::pair<int, int> best = std::max(std::max(c1, c2), c3);

    return {best.second, best.first, std::min(min, rhs.min),
            std::max(max, rhs.max)};
  }
};
struct RightNode {
  int a, b, min, max;

  RightNode() : a(-1), b(-1), min(2'000'000'000), max(-2'000'000'000) {}
  RightNode(int a) : a(-1), b(-1), min(a), max(a) {}
  RightNode(int a, int b, int min, int max) : a(a), b(b), min(min), max(max) {}

  RightNode operator*(const RightNode &rhs) const {
    std::pair<int, int> c1 = {b, a};
    std::pair<int, int> c2 = {rhs.b, rhs.a};
    std::pair<int, int> c3 = {-1, -1};
    if (max >= 0 && max - rhs.min >= d) {
      c3 = {max, rhs.min};
    }

    std::pair<int, int> best = std::max(std::max(c1, c2), c3);

    return {best.second, best.first, std::min(min, rhs.min),
            std::max(max, rhs.max)};
  }
};

struct PrecomputedData {
  std::unordered_set<int> included_s;
  std::vector<int> prefix_sums, prev, next;

  SegmentTree<LeftNode> left_st;
  SegmentTree<RightNode> right_st;
};

std::optional<PrecomputedData> precomputed;

int max_towers(int L, int R, int D) {
  if (L == R)
    return 1;
  R += 1;

  if (!precomputed) {
    d = D;
    std::vector<int> included{h[0]};
    int intermediary = h[0];
    for (int i = 1; i < n; i++) {
      if (h[i] > intermediary) {
        // println("Found new intermediary: {}", h[i]);
        intermediary = h[i];
      } else if (intermediary - included.back() < D) {
        if (h[i] < included.back()) {
          // println("Found better tower: {} instead of {}", h[i],
          // included.back());
          included.pop_back();
          included.push_back(h[i]);
          intermediary = h[i];
        } else {
          // println("Found new tower, but it's worse: {} instead of {}",
          // h[i], included.back());
        }
      } else if (intermediary - h[i] >= D) {
        // println("Found new tower: {} (previous was {}, greatest: {})",
        // h[i], included.back(), greatest);
        included.push_back(h[i]);
        intermediary = h[i];
      }
    }

    std::unordered_set<int> included_s(included.begin(), included.end());

    std::vector<int> prev, next;
    int prev_val = -1;
    for (int i = 0; i < n; i++) {
      if (included_s.count(h[i])) {
        prev_val = i;
      }
      prev.push_back(prev_val);
    }
    int next_val = -1;
    for (int i = n - 1; i >= 0; i--) {
      if (included_s.count(h[i])) {
        next_val = i;
      }
      next.push_back(next_val);
    }
    std::reverse(next.begin(), next.end());
    std::vector<int> prefix_sums{1};
    prefix_sums.reserve(n + 1);
    for (int i = 0; i < n; i++) {
      prefix_sums.push_back(prefix_sums.back() + included_s.count(h[i]));
    }

    int o = 1;
    while (o < n)
      o *= 2;

    SegmentTree<LeftNode> left_st(o);
    SegmentTree<RightNode> right_st(o);

    for (int i = 0; i < n; i++) {
      left_st.update(i, LeftNode(h[i]));
      right_st.update(i, RightNode(h[i]));
    }

    precomputed = std::make_optional(PrecomputedData{
        included_s, prefix_sums, prev, next, left_st, right_st});
  }

  int total = precomputed->prefix_sums[R] - precomputed->prefix_sums[L];

  int next = precomputed->next[L];
  auto q0 = precomputed->left_st.query(L, next);
  if (q0.b - h[next] >= D) {
    total += 1;
  }

  int prev = precomputed->prev[R - 1];
  auto q1 = precomputed->right_st.query(prev + 1, R);
  if (q1.b - h[prev] >= D) {
    total += 1;
  }

  return std::max(total, 1);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 330 ms 10328 KB 31st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 624 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 624 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 36 ms 12176 KB Output is correct
37 Correct 53 ms 20392 KB Output is correct
38 Correct 57 ms 21632 KB Output is correct
39 Correct 52 ms 20012 KB Output is correct
40 Correct 59 ms 23128 KB Output is correct
41 Correct 55 ms 21736 KB Output is correct
42 Correct 60 ms 23916 KB Output is correct
43 Correct 48 ms 19904 KB Output is correct
44 Correct 47 ms 19788 KB Output is correct
45 Correct 44 ms 19840 KB Output is correct
46 Correct 45 ms 19756 KB Output is correct
47 Correct 60 ms 22528 KB Output is correct
48 Correct 62 ms 23888 KB Output is correct
49 Correct 69 ms 23904 KB Output is correct
50 Correct 47 ms 19832 KB Output is correct
51 Correct 45 ms 19796 KB Output is correct
52 Correct 59 ms 22608 KB Output is correct
53 Correct 59 ms 23896 KB Output is correct
54 Correct 60 ms 23892 KB Output is correct
55 Correct 47 ms 19768 KB Output is correct
56 Correct 49 ms 19772 KB Output is correct
57 Correct 51 ms 20684 KB Output is correct
58 Correct 55 ms 21368 KB Output is correct
59 Correct 57 ms 21900 KB Output is correct
60 Correct 60 ms 23988 KB Output is correct
61 Correct 70 ms 23256 KB Output is correct
62 Correct 57 ms 22212 KB Output is correct
63 Correct 59 ms 23404 KB Output is correct
64 Correct 43 ms 19804 KB Output is correct
65 Correct 42 ms 19800 KB Output is correct
66 Correct 46 ms 19792 KB Output is correct
67 Correct 44 ms 19716 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 600 ms 22480 KB Output is correct
2 Correct 769 ms 22536 KB Output is correct
3 Correct 650 ms 22520 KB Output is correct
4 Correct 661 ms 24000 KB Output is correct
5 Correct 815 ms 23892 KB Output is correct
6 Correct 877 ms 23896 KB Output is correct
7 Correct 723 ms 23956 KB Output is correct
8 Correct 797 ms 19776 KB Output is correct
9 Correct 765 ms 19744 KB Output is correct
10 Correct 786 ms 19896 KB Output is correct
11 Correct 847 ms 19792 KB Output is correct
12 Correct 652 ms 19736 KB Output is correct
13 Correct 747 ms 19796 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 60 ms 22556 KB Output is correct
18 Correct 60 ms 23992 KB Output is correct
19 Correct 62 ms 23888 KB Output is correct
20 Correct 47 ms 19740 KB Output is correct
21 Correct 49 ms 19780 KB Output is correct
22 Correct 59 ms 22532 KB Output is correct
23 Correct 66 ms 23924 KB Output is correct
24 Correct 59 ms 23904 KB Output is correct
25 Correct 47 ms 19792 KB Output is correct
26 Correct 44 ms 19780 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 560 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 2 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 1 ms 584 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 243 ms 5732 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
2 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 624 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 36 ms 12176 KB Output is correct
37 Correct 53 ms 20392 KB Output is correct
38 Correct 57 ms 21632 KB Output is correct
39 Correct 52 ms 20012 KB Output is correct
40 Correct 59 ms 23128 KB Output is correct
41 Correct 55 ms 21736 KB Output is correct
42 Correct 60 ms 23916 KB Output is correct
43 Correct 48 ms 19904 KB Output is correct
44 Correct 47 ms 19788 KB Output is correct
45 Correct 44 ms 19840 KB Output is correct
46 Correct 45 ms 19756 KB Output is correct
47 Correct 60 ms 22528 KB Output is correct
48 Correct 62 ms 23888 KB Output is correct
49 Correct 69 ms 23904 KB Output is correct
50 Correct 47 ms 19832 KB Output is correct
51 Correct 45 ms 19796 KB Output is correct
52 Correct 59 ms 22608 KB Output is correct
53 Correct 59 ms 23896 KB Output is correct
54 Correct 60 ms 23892 KB Output is correct
55 Correct 47 ms 19768 KB Output is correct
56 Correct 49 ms 19772 KB Output is correct
57 Correct 51 ms 20684 KB Output is correct
58 Correct 55 ms 21368 KB Output is correct
59 Correct 57 ms 21900 KB Output is correct
60 Correct 60 ms 23988 KB Output is correct
61 Correct 70 ms 23256 KB Output is correct
62 Correct 57 ms 22212 KB Output is correct
63 Correct 59 ms 23404 KB Output is correct
64 Correct 43 ms 19804 KB Output is correct
65 Correct 42 ms 19800 KB Output is correct
66 Correct 46 ms 19792 KB Output is correct
67 Correct 44 ms 19716 KB Output is correct
68 Correct 600 ms 22480 KB Output is correct
69 Correct 769 ms 22536 KB Output is correct
70 Correct 650 ms 22520 KB Output is correct
71 Correct 661 ms 24000 KB Output is correct
72 Correct 815 ms 23892 KB Output is correct
73 Correct 877 ms 23896 KB Output is correct
74 Correct 723 ms 23956 KB Output is correct
75 Correct 797 ms 19776 KB Output is correct
76 Correct 765 ms 19744 KB Output is correct
77 Correct 786 ms 19896 KB Output is correct
78 Correct 847 ms 19792 KB Output is correct
79 Correct 652 ms 19736 KB Output is correct
80 Correct 747 ms 19796 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 592 KB Output is correct
83 Correct 1 ms 592 KB Output is correct
84 Correct 60 ms 22556 KB Output is correct
85 Correct 60 ms 23992 KB Output is correct
86 Correct 62 ms 23888 KB Output is correct
87 Correct 47 ms 19740 KB Output is correct
88 Correct 49 ms 19780 KB Output is correct
89 Correct 59 ms 22532 KB Output is correct
90 Correct 66 ms 23924 KB Output is correct
91 Correct 59 ms 23904 KB Output is correct
92 Correct 47 ms 19792 KB Output is correct
93 Correct 44 ms 19780 KB Output is correct
94 Correct 1 ms 592 KB Output is correct
95 Correct 2 ms 560 KB Output is correct
96 Correct 1 ms 592 KB Output is correct
97 Correct 1 ms 592 KB Output is correct
98 Correct 1 ms 592 KB Output is correct
99 Correct 2 ms 592 KB Output is correct
100 Correct 1 ms 592 KB Output is correct
101 Correct 1 ms 592 KB Output is correct
102 Correct 1 ms 592 KB Output is correct
103 Correct 1 ms 584 KB Output is correct
104 Correct 627 ms 21504 KB Output is correct
105 Correct 608 ms 21788 KB Output is correct
106 Correct 787 ms 21052 KB Output is correct
107 Correct 779 ms 22348 KB Output is correct
108 Correct 759 ms 20108 KB Output is correct
109 Correct 665 ms 22288 KB Output is correct
110 Correct 797 ms 23948 KB Output is correct
111 Correct 903 ms 19748 KB Output is correct
112 Correct 685 ms 19756 KB Output is correct
113 Correct 944 ms 19788 KB Output is correct
114 Correct 609 ms 19728 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 330 ms 10328 KB 31st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -