oj.uz

Submission #830924

# Submission time Handle Problem Language Result Execution time Memory
830924 2023-08-19T12:59:17 Z erray Rarest Insects (IOI22_insects) C++17
99.76 / 100
 52 ms 284 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/eagle/ioi22/d2/debug.h"
#else 
  #define debug(...) void(37)
#endif

int min_cardinality(int N) {
  vector<bool> in_set(N);
  vector<bool> deact(N);
  int cur = 0;
  auto Move = [&](int x) {
    if (x < cur) {
      for (int i = 0; i < N; ++i) {
        if (in_set[i] && !deact[i]) {
          in_set[i] = false;
          move_outside(i);
        }
      }
    } 
    for (int i = 0; i < N; ++i) {
      if (!in_set[i] && !deact[i]) {
        move_inside(i);
        in_set[i] = true;
        if (press_button() > x) {
          move_outside(i);
          in_set[i] = false;
        }
      }
    }
    cur = x;
    return accumulate(in_set.begin(), in_set.end(), 0);
  };
  int K = Move(1);
 for (int i = 0; i < N; ++i) {
    if (in_set[i]) {
      deact[i] = true;
    }
  }
         debug(K);
  int low = 2, high = (N / K) + 1;
  while (low < high) {
    int size = N - accumulate(deact.begin(), deact.end(), 0);
    int mid = low;
    int ls = K, rs = size - K;
    while (ls + K <= rs - K && mid + 1 <= high) {
      ls += K, rs -= K;
      ++mid;
    }
    /*
    if (ls > rs && mid > low) {
      --mid;
    }
    */
    int card = Move(mid);
    debug(mid, card);
    if (card == K * mid) {
      low = mid + 1;
      for (int i = 0; i < N; ++i) {
        if (in_set[i]) {
          deact[i] = true;
        }
      }
    } else {
      for (int i = 0; i < N; ++i) {
        if (!in_set[i]) {
          deact[i] = true;
        }
      }
      high = mid;
    }
  }
  return low - 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 5 ms 212 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
74.76 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Partially correct 40 ms 256 KB Output is partially correct
10 Correct 40 ms 208 KB Output is correct
11 Correct 25 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 24 ms 276 KB Output is correct
14 Correct 47 ms 208 KB Output is correct
15 Correct 51 ms 208 KB Output is correct
16 Correct 35 ms 208 KB Output is correct
17 Correct 24 ms 208 KB Output is correct
18 Correct 46 ms 208 KB Output is correct
19 Correct 45 ms 208 KB Output is correct
20 Correct 52 ms 208 KB Output is correct
21 Correct 49 ms 208 KB Output is correct
22 Correct 45 ms 284 KB Output is correct
23 Correct 36 ms 208 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 18 ms 208 KB Output is correct
26 Correct 18 ms 256 KB Output is correct
27 Partially correct 24 ms 208 KB Output is partially correct
28 Partially correct 38 ms 208 KB Output is partially correct
29 Partially correct 51 ms 208 KB Output is partially correct
30 Partially correct 22 ms 208 KB Output is partially correct
31 Correct 50 ms 280 KB Output is correct
32 Correct 19 ms 276 KB Output is correct
33 Correct 39 ms 256 KB Output is correct
34 Correct 51 ms 208 KB Output is correct
35 Partially correct 35 ms 208 KB Output is partially correct
36 Partially correct 43 ms 208 KB Output is partially correct
37 Correct 37 ms 280 KB Output is correct
38 Correct 37 ms 208 KB Output is correct
39 Partially correct 52 ms 256 KB Output is partially correct
40 Partially correct 37 ms 208 KB Output is partially correct
41 Partially correct 20 ms 208 KB Output is partially correct
42 Partially correct 51 ms 208 KB Output is partially correct
43 Correct 5 ms 208 KB Output is correct
44 Correct 32 ms 208 KB Output is correct
45 Correct 49 ms 256 KB Output is correct
46 Correct 15 ms 208 KB Output is correct
47 Correct 17 ms 208 KB Output is correct
48 Correct 14 ms 208 KB Output is correct