Submission #831371

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
831371	2023-08-20T07:31:21 Z	NeroZein	Rarest Insects (IOI22_insects)	C++17	10 / 100	280 ms	404 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std; 

int min_cardinality(int N) {
  int n = N; 
  vector<bool> removed(n); 
  while (true) {
    set<int> to_remove;
    int not_removed = 0; 
    for (int i = 0; i < n; ++i) {
      if (!removed[i]) {
        move_inside(i); 
        not_removed++; 
      }
    }
    int x = press_button();
    if (x == 1 || x == not_removed) return x;
    for (int i = 0; i < n; ++i) {
      if (!removed[i]) {
        move_outside(i); 
        int y = press_button();
        if (y < x) {
          move_inside(i); 
          to_remove.insert(i); 
        }
      }
    }
    for (int i : to_remove) {
      move_outside(i); 
      removed[i] = true;
    }
  }
}

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	0 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	14 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	2 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	6 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	9 ms	208 KB	Output is correct
19	Correct	19 ms	208 KB	Output is correct
20	Correct	22 ms	208 KB	Output is correct
21	Correct	47 ms	208 KB	Output is correct
22	Correct	56 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	0 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	14 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	2 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	6 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	9 ms	208 KB	Output is correct
19	Correct	19 ms	208 KB	Output is correct
20	Correct	22 ms	208 KB	Output is correct
21	Correct	47 ms	208 KB	Output is correct
22	Correct	56 ms	208 KB	Output is correct
23	Correct	0 ms	208 KB	Output is correct
24	Correct	0 ms	208 KB	Output is correct
25	Correct	140 ms	288 KB	Output is correct
26	Correct	91 ms	296 KB	Output is correct
27	Correct	12 ms	304 KB	Output is correct
28	Correct	4 ms	296 KB	Output is correct
29	Correct	16 ms	304 KB	Output is correct
30	Correct	138 ms	276 KB	Output is correct
31	Correct	25 ms	208 KB	Output is correct
32	Correct	23 ms	304 KB	Output is correct
33	Correct	45 ms	280 KB	Output is correct
34	Correct	36 ms	208 KB	Output is correct
35	Correct	49 ms	208 KB	Output is correct
36	Correct	69 ms	288 KB	Output is correct
37	Correct	144 ms	276 KB	Output is correct
38	Incorrect	280 ms	284 KB	Too many queries.
39	Halted	0 ms	0 KB	-

Subtask #3

0 / 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	1 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	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	Incorrect	239 ms	404 KB	Too many queries.
10	Halted	0 ms	0 KB	-