oj.uz

Submission #798516

# Submission time Handle Problem Language Result Execution time Memory
798516 2023-07-30T19:25:53 Z jakobrs Radio Towers (IOI22_towers) C++17
60 / 100
 913 ms 24012 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;

int max_idx;

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

  max_idx = 0;
  for (int i = 1; i < N; i++) {
    if (H[i] > H[max_idx]) {
      max_idx = i;
    }
  }
}

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});
  }

  if (D != d) {
    if (R - 1 <= max_idx) {
      return 1;
    }
    if (L >= max_idx) {
      return 1;
    }

    int a = h[L];
    int b = h[R - 1];
    int c = h[max_idx];

    if (c - a >= D && c - b >= D) {
      return 2;
    } else {
      return 1;
    }
  }

  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
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 10272 KB Output is correct
2 Correct 734 ms 19788 KB Output is correct
3 Correct 761 ms 19776 KB Output is correct
4 Correct 718 ms 19776 KB Output is correct
5 Correct 782 ms 19720 KB Output is correct
6 Correct 729 ms 19744 KB Output is correct
7 Correct 771 ms 19772 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 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 0 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 640 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 592 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 0 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 2 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 0 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 640 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 592 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 12180 KB Output is correct
37 Correct 50 ms 20432 KB Output is correct
38 Correct 56 ms 21612 KB Output is correct
39 Correct 46 ms 19904 KB Output is correct
40 Correct 58 ms 23236 KB Output is correct
41 Correct 55 ms 21672 KB Output is correct
42 Correct 59 ms 23944 KB Output is correct
43 Correct 42 ms 19764 KB Output is correct
44 Correct 42 ms 19728 KB Output is correct
45 Correct 42 ms 19800 KB Output is correct
46 Correct 45 ms 19788 KB Output is correct
47 Correct 58 ms 22592 KB Output is correct
48 Correct 61 ms 23912 KB Output is correct
49 Correct 62 ms 23896 KB Output is correct
50 Correct 46 ms 19748 KB Output is correct
51 Correct 44 ms 19792 KB Output is correct
52 Correct 59 ms 22532 KB Output is correct
53 Correct 60 ms 23984 KB Output is correct
54 Correct 65 ms 23888 KB Output is correct
55 Correct 50 ms 19840 KB Output is correct
56 Correct 43 ms 19776 KB Output is correct
57 Correct 49 ms 20704 KB Output is correct
58 Correct 54 ms 21368 KB Output is correct
59 Correct 55 ms 21824 KB Output is correct
60 Correct 65 ms 23892 KB Output is correct
61 Correct 64 ms 23232 KB Output is correct
62 Correct 56 ms 22168 KB Output is correct
63 Correct 58 ms 23396 KB Output is correct
64 Correct 42 ms 19776 KB Output is correct
65 Correct 42 ms 19772 KB Output is correct
66 Correct 44 ms 19716 KB Output is correct
67 Correct 42 ms 19788 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 22476 KB Output is correct
2 Correct 521 ms 22592 KB Output is correct
3 Correct 655 ms 22532 KB Output is correct
4 Correct 809 ms 23964 KB Output is correct
5 Correct 784 ms 24000 KB Output is correct
6 Correct 747 ms 24000 KB Output is correct
7 Correct 838 ms 24000 KB Output is correct
8 Correct 710 ms 19776 KB Output is correct
9 Correct 913 ms 19780 KB Output is correct
10 Correct 637 ms 19720 KB Output is correct
11 Correct 683 ms 19792 KB Output is correct
12 Correct 648 ms 19784 KB Output is correct
13 Correct 825 ms 19792 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 65 ms 22532 KB Output is correct
18 Correct 62 ms 24012 KB Output is correct
19 Correct 61 ms 23888 KB Output is correct
20 Correct 48 ms 19784 KB Output is correct
21 Correct 43 ms 19772 KB Output is correct
22 Correct 68 ms 22556 KB Output is correct
23 Correct 65 ms 23888 KB Output is correct
24 Correct 59 ms 23916 KB Output is correct
25 Correct 47 ms 19788 KB Output is correct
26 Correct 44 ms 19812 KB Output is correct
27 Correct 1 ms 640 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 616 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 640 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 592 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 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 0 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 640 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 592 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 12180 KB Output is correct
37 Correct 50 ms 20432 KB Output is correct
38 Correct 56 ms 21612 KB Output is correct
39 Correct 46 ms 19904 KB Output is correct
40 Correct 58 ms 23236 KB Output is correct
41 Correct 55 ms 21672 KB Output is correct
42 Correct 59 ms 23944 KB Output is correct
43 Correct 42 ms 19764 KB Output is correct
44 Correct 42 ms 19728 KB Output is correct
45 Correct 42 ms 19800 KB Output is correct
46 Correct 45 ms 19788 KB Output is correct
47 Correct 58 ms 22592 KB Output is correct
48 Correct 61 ms 23912 KB Output is correct
49 Correct 62 ms 23896 KB Output is correct
50 Correct 46 ms 19748 KB Output is correct
51 Correct 44 ms 19792 KB Output is correct
52 Correct 59 ms 22532 KB Output is correct
53 Correct 60 ms 23984 KB Output is correct
54 Correct 65 ms 23888 KB Output is correct
55 Correct 50 ms 19840 KB Output is correct
56 Correct 43 ms 19776 KB Output is correct
57 Correct 49 ms 20704 KB Output is correct
58 Correct 54 ms 21368 KB Output is correct
59 Correct 55 ms 21824 KB Output is correct
60 Correct 65 ms 23892 KB Output is correct
61 Correct 64 ms 23232 KB Output is correct
62 Correct 56 ms 22168 KB Output is correct
63 Correct 58 ms 23396 KB Output is correct
64 Correct 42 ms 19776 KB Output is correct
65 Correct 42 ms 19772 KB Output is correct
66 Correct 44 ms 19716 KB Output is correct
67 Correct 42 ms 19788 KB Output is correct
68 Correct 485 ms 22476 KB Output is correct
69 Correct 521 ms 22592 KB Output is correct
70 Correct 655 ms 22532 KB Output is correct
71 Correct 809 ms 23964 KB Output is correct
72 Correct 784 ms 24000 KB Output is correct
73 Correct 747 ms 24000 KB Output is correct
74 Correct 838 ms 24000 KB Output is correct
75 Correct 710 ms 19776 KB Output is correct
76 Correct 913 ms 19780 KB Output is correct
77 Correct 637 ms 19720 KB Output is correct
78 Correct 683 ms 19792 KB Output is correct
79 Correct 648 ms 19784 KB Output is correct
80 Correct 825 ms 19792 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 65 ms 22532 KB Output is correct
85 Correct 62 ms 24012 KB Output is correct
86 Correct 61 ms 23888 KB Output is correct
87 Correct 48 ms 19784 KB Output is correct
88 Correct 43 ms 19772 KB Output is correct
89 Correct 68 ms 22556 KB Output is correct
90 Correct 65 ms 23888 KB Output is correct
91 Correct 59 ms 23916 KB Output is correct
92 Correct 47 ms 19788 KB Output is correct
93 Correct 44 ms 19812 KB Output is correct
94 Correct 1 ms 640 KB Output is correct
95 Correct 1 ms 592 KB Output is correct
96 Correct 1 ms 592 KB Output is correct
97 Correct 1 ms 616 KB Output is correct
98 Correct 1 ms 588 KB Output is correct
99 Correct 1 ms 592 KB Output is correct
100 Correct 1 ms 640 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 592 KB Output is correct
104 Correct 540 ms 21508 KB Output is correct
105 Correct 666 ms 21732 KB Output is correct
106 Correct 808 ms 20936 KB Output is correct
107 Correct 813 ms 22432 KB Output is correct
108 Correct 687 ms 20160 KB Output is correct
109 Correct 804 ms 22204 KB Output is correct
110 Correct 605 ms 23884 KB Output is correct
111 Correct 772 ms 19788 KB Output is correct
112 Correct 809 ms 19800 KB Output is correct
113 Correct 827 ms 19800 KB Output is correct
114 Correct 619 ms 19744 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 10272 KB Output is correct
2 Correct 734 ms 19788 KB Output is correct
3 Correct 761 ms 19776 KB Output is correct
4 Correct 718 ms 19776 KB Output is correct
5 Correct 782 ms 19720 KB Output is correct
6 Correct 729 ms 19744 KB Output is correct
7 Correct 771 ms 19772 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 2 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 0 ms 208 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 592 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 592 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 336 KB Output is correct
36 Correct 1 ms 592 KB Output is correct
37 Correct 1 ms 640 KB Output is correct
38 Correct 1 ms 592 KB Output is correct
39 Correct 1 ms 592 KB Output is correct
40 Correct 1 ms 592 KB Output is correct
41 Correct 1 ms 592 KB Output is correct
42 Correct 1 ms 592 KB Output is correct
43 Correct 1 ms 592 KB Output is correct
44 Correct 1 ms 592 KB Output is correct
45 Correct 1 ms 592 KB Output is correct
46 Correct 36 ms 12180 KB Output is correct
47 Correct 50 ms 20432 KB Output is correct
48 Correct 56 ms 21612 KB Output is correct
49 Correct 46 ms 19904 KB Output is correct
50 Correct 58 ms 23236 KB Output is correct
51 Correct 55 ms 21672 KB Output is correct
52 Correct 59 ms 23944 KB Output is correct
53 Correct 42 ms 19764 KB Output is correct
54 Correct 42 ms 19728 KB Output is correct
55 Correct 42 ms 19800 KB Output is correct
56 Correct 45 ms 19788 KB Output is correct
57 Correct 58 ms 22592 KB Output is correct
58 Correct 61 ms 23912 KB Output is correct
59 Correct 62 ms 23896 KB Output is correct
60 Correct 46 ms 19748 KB Output is correct
61 Correct 44 ms 19792 KB Output is correct
62 Correct 59 ms 22532 KB Output is correct
63 Correct 60 ms 23984 KB Output is correct
64 Correct 65 ms 23888 KB Output is correct
65 Correct 50 ms 19840 KB Output is correct
66 Correct 43 ms 19776 KB Output is correct
67 Correct 49 ms 20704 KB Output is correct
68 Correct 54 ms 21368 KB Output is correct
69 Correct 55 ms 21824 KB Output is correct
70 Correct 65 ms 23892 KB Output is correct
71 Correct 64 ms 23232 KB Output is correct
72 Correct 56 ms 22168 KB Output is correct
73 Correct 58 ms 23396 KB Output is correct
74 Correct 42 ms 19776 KB Output is correct
75 Correct 42 ms 19772 KB Output is correct
76 Correct 44 ms 19716 KB Output is correct
77 Correct 42 ms 19788 KB Output is correct
78 Correct 485 ms 22476 KB Output is correct
79 Correct 521 ms 22592 KB Output is correct
80 Correct 655 ms 22532 KB Output is correct
81 Correct 809 ms 23964 KB Output is correct
82 Correct 784 ms 24000 KB Output is correct
83 Correct 747 ms 24000 KB Output is correct
84 Correct 838 ms 24000 KB Output is correct
85 Correct 710 ms 19776 KB Output is correct
86 Correct 913 ms 19780 KB Output is correct
87 Correct 637 ms 19720 KB Output is correct
88 Correct 683 ms 19792 KB Output is correct
89 Correct 648 ms 19784 KB Output is correct
90 Correct 825 ms 19792 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 1 ms 592 KB Output is correct
94 Correct 65 ms 22532 KB Output is correct
95 Correct 62 ms 24012 KB Output is correct
96 Correct 61 ms 23888 KB Output is correct
97 Correct 48 ms 19784 KB Output is correct
98 Correct 43 ms 19772 KB Output is correct
99 Correct 68 ms 22556 KB Output is correct
100 Correct 65 ms 23888 KB Output is correct
101 Correct 59 ms 23916 KB Output is correct
102 Correct 47 ms 19788 KB Output is correct
103 Correct 44 ms 19812 KB Output is correct
104 Correct 1 ms 640 KB Output is correct
105 Correct 1 ms 592 KB Output is correct
106 Correct 1 ms 592 KB Output is correct
107 Correct 1 ms 616 KB Output is correct
108 Correct 1 ms 588 KB Output is correct
109 Correct 1 ms 592 KB Output is correct
110 Correct 1 ms 640 KB Output is correct
111 Correct 1 ms 592 KB Output is correct
112 Correct 1 ms 592 KB Output is correct
113 Correct 1 ms 592 KB Output is correct
114 Incorrect 204 ms 5712 KB 2nd lines differ - on the 1st token, expected: '7063', found: '2'
115 Halted 0 ms 0 KB -