oj.uz

Submission #798472

# Submission time Handle Problem Language Result Execution time Memory
798472 2023-07-30T18:15:33 Z jakobrs Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 1480 KB 
#include <vector>

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

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

  std::vector<int> included{h[L]};
  int greatest = h[L];
  for (int i = L + 1; i < R; i++) {
    if (h[i] > greatest) {
      // println("Found new intermediary: {}", h[i]);
      greatest = h[i];
    } else if (greatest - 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]);
        greatest = h[i];
      } else {
        // println("Found new tower, but it's worse: {} instead of {}", h[i], included.back());
      }
    } else if (greatest - h[i] >= D) {
      // println("Found new tower: {} (previous was {}, greatest: {})", h[i], included.back(), greatest);
      included.push_back(h[i]);
      greatest = h[i];
    }
  }

  return included.size();
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 954 ms 920 KB Output is correct
2 Correct 2936 ms 1452 KB Output is correct
3 Correct 2739 ms 1360 KB Output is correct
4 Correct 2642 ms 1420 KB Output is correct
5 Execution timed out 4057 ms 1352 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 284 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 6 ms 1024 KB Output is correct
37 Correct 10 ms 1428 KB Output is correct
38 Correct 15 ms 1444 KB Output is correct
39 Correct 9 ms 1440 KB Output is correct
40 Correct 9 ms 1360 KB Output is correct
41 Correct 9 ms 1420 KB Output is correct
42 Correct 9 ms 1432 KB Output is correct
43 Correct 15 ms 1420 KB Output is correct
44 Correct 9 ms 1360 KB Output is correct
45 Correct 16 ms 1444 KB Output is correct
46 Correct 15 ms 1460 KB Output is correct
47 Correct 9 ms 1436 KB Output is correct
48 Correct 13 ms 1432 KB Output is correct
49 Correct 15 ms 1448 KB Output is correct
50 Correct 10 ms 1360 KB Output is correct
51 Correct 9 ms 1424 KB Output is correct
52 Correct 9 ms 1428 KB Output is correct
53 Correct 9 ms 1424 KB Output is correct
54 Correct 10 ms 1436 KB Output is correct
55 Correct 10 ms 1360 KB Output is correct
56 Correct 10 ms 1448 KB Output is correct
57 Correct 14 ms 1308 KB Output is correct
58 Correct 10 ms 1444 KB Output is correct
59 Correct 10 ms 1428 KB Output is correct
60 Correct 9 ms 1424 KB Output is correct
61 Correct 9 ms 1480 KB Output is correct
62 Correct 9 ms 1448 KB Output is correct
63 Correct 11 ms 1428 KB Output is correct
64 Correct 11 ms 1424 KB Output is correct
65 Correct 12 ms 1428 KB Output is correct
66 Correct 9 ms 1360 KB Output is correct
67 Correct 9 ms 1452 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4064 ms 1316 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3808 ms 544 KB Output is correct
2 Execution timed out 4003 ms 1360 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 284 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 6 ms 1024 KB Output is correct
37 Correct 10 ms 1428 KB Output is correct
38 Correct 15 ms 1444 KB Output is correct
39 Correct 9 ms 1440 KB Output is correct
40 Correct 9 ms 1360 KB Output is correct
41 Correct 9 ms 1420 KB Output is correct
42 Correct 9 ms 1432 KB Output is correct
43 Correct 15 ms 1420 KB Output is correct
44 Correct 9 ms 1360 KB Output is correct
45 Correct 16 ms 1444 KB Output is correct
46 Correct 15 ms 1460 KB Output is correct
47 Correct 9 ms 1436 KB Output is correct
48 Correct 13 ms 1432 KB Output is correct
49 Correct 15 ms 1448 KB Output is correct
50 Correct 10 ms 1360 KB Output is correct
51 Correct 9 ms 1424 KB Output is correct
52 Correct 9 ms 1428 KB Output is correct
53 Correct 9 ms 1424 KB Output is correct
54 Correct 10 ms 1436 KB Output is correct
55 Correct 10 ms 1360 KB Output is correct
56 Correct 10 ms 1448 KB Output is correct
57 Correct 14 ms 1308 KB Output is correct
58 Correct 10 ms 1444 KB Output is correct
59 Correct 10 ms 1428 KB Output is correct
60 Correct 9 ms 1424 KB Output is correct
61 Correct 9 ms 1480 KB Output is correct
62 Correct 9 ms 1448 KB Output is correct
63 Correct 11 ms 1428 KB Output is correct
64 Correct 11 ms 1424 KB Output is correct
65 Correct 12 ms 1428 KB Output is correct
66 Correct 9 ms 1360 KB Output is correct
67 Correct 9 ms 1452 KB Output is correct
68 Execution timed out 4064 ms 1316 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 954 ms 920 KB Output is correct
2 Correct 2936 ms 1452 KB Output is correct
3 Correct 2739 ms 1360 KB Output is correct
4 Correct 2642 ms 1420 KB Output is correct
5 Execution timed out 4057 ms 1352 KB Time limit exceeded
6 Halted 0 ms 0 KB -