Submission #627248

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
627248	2022-08-12T11:38:01 Z	model_code	Rarest Insects (IOI22_insects)	C++17	10 / 100	483 ms	332 KB

insects

// protocol_violation/solution-subtask-1.cpp
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) {
  int ans = N;
  for (int i = 0; i < N; i++) {
    int cnt = 1;
    move_inside(i);
    for (int j = 0; j < N; j++) {
      if (i != j) {
        move_inside(j);
        if (press_button() == 2) {
          cnt++;
        }
        move_outside(j);
      }
    }
    move_outside(i);
    ans = min(ans,cnt);
  }
  return ans;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	483 ms	208 KB	Output is correct
7	Correct	266 ms	208 KB	Output is correct
8	Correct	406 ms	208 KB	Output is correct
9	Correct	227 ms	208 KB	Output is correct
10	Correct	318 ms	208 KB	Output is correct
11	Correct	327 ms	208 KB	Output is correct
12	Correct	267 ms	332 KB	Output is correct
13	Correct	362 ms	208 KB	Output is correct
14	Correct	324 ms	208 KB	Output is correct
15	Correct	208 ms	208 KB	Output is correct
16	Correct	322 ms	208 KB	Output is correct
17	Correct	288 ms	208 KB	Output is correct
18	Correct	255 ms	208 KB	Output is correct
19	Correct	218 ms	208 KB	Output is correct
20	Correct	229 ms	208 KB	Output is correct
21	Correct	362 ms	208 KB	Output is correct
22	Correct	229 ms	208 KB	Output is correct

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	483 ms	208 KB	Output is correct
7	Correct	266 ms	208 KB	Output is correct
8	Correct	406 ms	208 KB	Output is correct
9	Correct	227 ms	208 KB	Output is correct
10	Correct	318 ms	208 KB	Output is correct
11	Correct	327 ms	208 KB	Output is correct
12	Correct	267 ms	332 KB	Output is correct
13	Correct	362 ms	208 KB	Output is correct
14	Correct	324 ms	208 KB	Output is correct
15	Correct	208 ms	208 KB	Output is correct
16	Correct	322 ms	208 KB	Output is correct
17	Correct	288 ms	208 KB	Output is correct
18	Correct	255 ms	208 KB	Output is correct
19	Correct	218 ms	208 KB	Output is correct
20	Correct	229 ms	208 KB	Output is correct
21	Correct	362 ms	208 KB	Output is correct
22	Correct	229 ms	208 KB	Output is correct
23	Incorrect	271 ms	208 KB	Too many queries.
24	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	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	Partially correct	1 ms	208 KB	Output is partially correct
6	Partially correct	1 ms	208 KB	Output is partially correct
7	Incorrect	373 ms	208 KB	Too many queries.
8	Halted	0 ms	0 KB	-