답안 #924813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
924813	2024-02-09T18:03:41 Z	AkibAzmain	드문 곤충 (IOI22_insects)	C++17	10 / 100	219 ms	596 KB

insects

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

int min_cardinality (int n) {
  vector < int > a (n, -1);
  vector < int > c;
  int ci = 0;
  for (int i = 0; i < n; ++i)
    {
      if (a[i] != -1) continue;
      a[i] = ci++;
      c.push_back (1);
      move_inside (i);
      for (int j = i + 1; j < n; ++j)
        {
          if (a[j] != -1) continue;
          move_inside (j);
          if (press_button () == 2)
            a[j] = a[i], ++c[a[i]];
          move_outside (j);
      }
      move_outside (i);
    }
  return *min_element (c.begin (), c.end ());
}

Subtask #1

10.0 / 10.0

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

Subtask #2

0 / 15.0

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