oj.uz

Submission #788564

# Submission time Handle Problem Language Result Execution time Memory
788564 2023-07-20T11:04:40 Z thimote75 Rarest Insects (IOI22_insects) C++17
10 / 100
 233 ms 304 KB 
#include "insects.h"

#include <bits/stdc++.h>

using namespace std;

using bdata = vector<bool>;
using idata = vector<int>;

bdata found;

int check (int x, int N) {
  if (found[x]) return 1e9;
  idata inner;

  for (int i = x; i < N; i ++) {
    if (found[i]) continue ;

    move_inside(i);
    if (press_button() == inner.size()) {
      move_outside(i);
      continue ;
    }

    inner.push_back(i);
    found[i] = true;
  }

  for (int u : inner) move_outside(u);
  return inner.size();
}

int min_cardinality(int N) {
  found.resize(N);
  int res = 1e9;
  for (int i = 0; i < N; i ++)
    res = min(res, check(i, N));

  return res;
}

Compilation message

insects.cpp: In function 'int check(int, int)':
insects.cpp:20:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     if (press_button() == inner.size()) {
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~

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 2 ms 208 KB Output is correct
7 Correct 131 ms 208 KB Output is correct
8 Correct 13 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 41 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 16 ms 208 KB Output is correct
20 Correct 36 ms 208 KB Output is correct
21 Correct 58 ms 208 KB Output is correct
22 Correct 96 ms 208 KB Output is correct

Subtask #2
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 2 ms 208 KB Output is correct
7 Correct 131 ms 208 KB Output is correct
8 Correct 13 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 41 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 16 ms 208 KB Output is correct
20 Correct 36 ms 208 KB Output is correct
21 Correct 58 ms 208 KB Output is correct
22 Correct 96 ms 208 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Incorrect 176 ms 208 KB Too many queries.
25 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 16 ms 304 KB Output is correct
8 Incorrect 233 ms 208 KB Too many queries.
9 Halted 0 ms 0 KB -