답안 #1008485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008485	2024-06-26T13:18:23 Z	oyber	드문 곤충 (IOI22_insects)	C++17	10 / 100	230 ms	596 KB

insects

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

int min_cardinality(int N) {
  vector<bool> used(N);
  int types = 0;
  for (int i = 0; i < N; i++) {
    move_inside(i);
    if (press_button() > 1) {
      move_outside(i);
      continue;
    }
    types++;
    used[i] = true;
  }
  //printf("types: %d\n", types);

  for (int num = 2; num <= N; num++) {
    int added = 0;
    for (int i = 0; i < N; i++) {
      if (used[i]) continue;
      move_inside(i);
      int p = press_button();
      //printf("num: %d i: %d p: %d\n", num, i, p);
      if (p > num) {
        move_outside(i);
        continue;
      }
      added++;
      used[i] = true;
    }
    if (added != types) {
      return num-1;
    }
  }
  return N;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	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	99 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	17 ms	344 KB	Output is correct
15	Correct	11 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	8 ms	344 KB	Output is correct
18	Correct	2 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	2 ms	344 KB	Output is correct

Subtask #2

0 / 15.0

#	결과	실행 시간	메모리	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	99 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	17 ms	344 KB	Output is correct
15	Correct	11 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	8 ms	344 KB	Output is correct
18	Correct	2 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	2 ms	344 KB	Output is correct
23	Incorrect	230 ms	344 KB	Too many queries.
24	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	결과	실행 시간	메모리	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	1 ms	344 KB	Output is correct
7	Incorrect	227 ms	344 KB	Too many queries.
8	Halted	0 ms	0 KB	-