Submission #858681

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
858681	2023-10-09T04:34:04 Z	Cpy	Rarest Insects (IOI22_insects)	C++17	10 / 100	217 ms	688 KB

insects

#include "insects.h"
#include <algorithm>
using namespace std;

int type[2001], q[2001], cr[2001];

int min_cardinality(int n) {
  int t = 0, mx = 1e9;
  for (int i = 0; i < n; ++i) {
    move_inside(i);
    if (press_button() > 1) {
      for (int j = 0; j < t; ++j) {
        move_outside(cr[j]);
        if (press_button() == 1) {
          ++type[cr[j]];
          move_inside(cr[j]);
          break;
        }
        move_inside(cr[j]);
      }
      move_outside(i);
    } else cr[t++] = i, ++type[i];
  }
  for (int i = 0; i < t; ++i) mx = min(mx, type[cr[i]]);
  return mx;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	8 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	7 ms	344 KB	Output is correct
14	Correct	5 ms	344 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	344 KB	Output is correct
17	Correct	6 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	9 ms	344 KB	Output is correct
20	Correct	16 ms	344 KB	Output is correct
21	Correct	20 ms	344 KB	Output is correct
22	Correct	23 ms	344 KB	Output is correct
23	Correct	9 ms	344 KB	Output is correct
24	Correct	4 ms	600 KB	Output is correct
25	Correct	84 ms	344 KB	Output is correct
26	Correct	90 ms	344 KB	Output is correct
27	Correct	10 ms	344 KB	Output is correct
28	Correct	6 ms	600 KB	Output is correct
29	Correct	12 ms	344 KB	Output is correct
30	Correct	77 ms	344 KB	Output is correct
31	Correct	19 ms	344 KB	Output is correct
32	Correct	25 ms	344 KB	Output is correct
33	Correct	33 ms	344 KB	Output is correct
34	Correct	35 ms	344 KB	Output is correct
35	Correct	50 ms	344 KB	Output is correct
36	Correct	50 ms	344 KB	Output is correct
37	Correct	123 ms	344 KB	Output is correct
38	Incorrect	216 ms	344 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	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	16 ms	344 KB	Output is correct
8	Correct	10 ms	688 KB	Output is correct
9	Incorrect	217 ms	344 KB	Too many queries.
10	Halted	0 ms	0 KB	-