oj.uz

Submission #944952

# Submission time Handle Problem Language Result Execution time Memory
944952 2024-03-13T08:47:07 Z imann Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 69 ms 5716 KB 
#include <iostream>
#include <array>
#include <algorithm>
#include <limits>

using ll = long long;

const int MAX_N = 2*1000*100 + 3;

std::array<ll, MAX_N> As, dp;

int solve(int n) {
  std::reverse(As.begin(), As.begin() + n);

  dp.fill(std::numeric_limits<ll>::max());
  for (int i = 0; i < n; ++i) {
    if (As[i] <= 0) {
      int j = std::upper_bound(dp.begin(), dp.begin() + n, As[i]) - dp.begin();
      dp[j] = As[i];
    }
  }

  int ans = 0;
  for (int i = 0; i < n; ++i) {
    if (dp[i] != std::numeric_limits<ll>::max())
      ans = i + 1;
  }
  return ans;
}

int main() {
  int n, m; std::cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    std::cin >> As[i];
    As[i] -= (i + 1) * m;
  }
  std::cout << n - solve(n) << std::endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2484 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2904 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2676 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2484 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2904 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2676 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2500 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2660 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2504 KB Output is correct
32 Correct 3 ms 2904 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2500 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2660 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2504 KB Output is correct
16 Correct 3 ms 2904 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2492 KB Output is correct
22 Correct 1 ms 2484 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2648 KB Output is correct
29 Correct 1 ms 2904 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2676 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 2 ms 2540 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 2 ms 2652 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 2 ms 2652 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct
41 Correct 2 ms 2652 KB Output is correct
42 Correct 2 ms 2648 KB Output is correct
43 Correct 2 ms 2652 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 2 ms 2540 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2500 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2660 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2504 KB Output is correct
26 Correct 3 ms 2904 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2492 KB Output is correct
32 Correct 1 ms 2484 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2648 KB Output is correct
39 Correct 1 ms 2904 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 1 ms 2676 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 35 ms 3928 KB Output is correct
45 Correct 58 ms 5356 KB Output is correct
46 Correct 61 ms 5716 KB Output is correct
47 Correct 61 ms 5456 KB Output is correct
48 Correct 44 ms 4436 KB Output is correct
49 Correct 48 ms 4684 KB Output is correct
50 Correct 65 ms 5356 KB Output is correct
51 Correct 69 ms 5308 KB Output is correct
52 Correct 46 ms 4180 KB Output is correct
53 Correct 41 ms 4688 KB Output is correct
54 Correct 46 ms 4436 KB Output is correct
55 Correct 46 ms 4516 KB Output is correct