oj.uz

Submission #954484

# Submission time Handle Problem Language Result Execution time Memory
954484 2024-03-28T03:34:35 Z vjudge1 Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 21 ms 4576 KB 
#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main() {
  fastio;
  int n, m, i;
  cin >> n >> m;
  vector<int> poles;
  for (i = 1; i <= n; i++) {
    int a;
    cin >> a;
    if (a - i * m > 0) {
        continue;
    }
    poles.push_back(a - i * m);
  }

//   for (i = 0; i < poles.size(); i++) {
//       cout << poles[i] << ' ';
//   }
//   cout << endl << endl;

  vector<int> s;
  //vector<int> v;
  int best_ans = 0;
  for (i = 0; i < poles.size(); i++) {
    auto it = upper_bound(s.begin(), s.end(), poles[i], greater<int>());
    if (it == s.end()) {
      //cout << "new deck" << endl;
      s.push_back(poles[i]);
      //v.push_back(1);
      //best_ans = max(best_ans, int(v.size()));
      best_ans++;
      //cout << "bestans " << best_ans << endl;
      continue;
    }
    s[it - s.begin()] = poles[i];
    //cout << "inserted into deck " << it - s.begin() << '\n';
    //v[it - s.begin()]++;
    //best_ans = max(best_ans, v[it - s.begin()]);
    //cout << "best ans " << best_ans << endl;
  }

//   for (auto ss : s) {
//     cout << ss << ' ';
//   }

  //cout << endl << endl;
  cout << n - best_ans << '\n';
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:27:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for (i = 0; i < poles.size(); i++) {
      |               ~~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 452 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 452 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 480 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 352 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 352 KB Output is correct
42 Correct 1 ms 472 KB Output is correct
43 Correct 1 ms 348 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 480 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 472 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 452 KB Output is correct
44 Correct 12 ms 3032 KB Output is correct
45 Correct 16 ms 2392 KB Output is correct
46 Correct 21 ms 2780 KB Output is correct
47 Correct 21 ms 2784 KB Output is correct
48 Correct 15 ms 3548 KB Output is correct
49 Correct 16 ms 3788 KB Output is correct
50 Correct 19 ms 3860 KB Output is correct
51 Correct 20 ms 4576 KB Output is correct
52 Correct 17 ms 3036 KB Output is correct
53 Correct 12 ms 1632 KB Output is correct
54 Correct 17 ms 3804 KB Output is correct
55 Correct 17 ms 3792 KB Output is correct