답안 #859006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859006	2023-10-09T14:17:44 Z	thinknoexit	드문 곤충 (IOI22_insects)	C++17	10 / 100	185 ms	600 KB

insects

#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
int min_cardinality(int n) {
    int type = 0;
    for (int i = 0;i < n;i++) {
        move_inside(i);
        if (press_button() == 2) {
            move_outside(i);
        }
        else in[i] = 1, type++;
    }
    for (int i = 0;i < n;i++) if (in[i] == 1) move_outside(i);
    if (type == 1) return n;
    int mxans = n / type;
    for (int i = 1;i <= mxans;i++) {
        int cnt = 0;
        for (int j = 0;j < n;j++) {
            if (in[j]) continue;
            move_inside(j);
            if (press_button() == 2) {
                move_outside(j);
            }
            else in[j] = i + 1, cnt++;
        }
        if (cnt != type) return i;
        for (int j = 0;j < n;j++) if (in[j] == i + 1) move_outside(j);
    }
    // n , n , n
    /*
        ans <= n / type
        ans <= n - mx
    */

}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^

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	592 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	500 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	3 ms	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	19 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	6 ms	344 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 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	592 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	500 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	3 ms	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	19 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	6 ms	344 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	4 ms	344 KB	Output is correct
24	Correct	5 ms	600 KB	Output is correct
25	Correct	73 ms	416 KB	Output is correct
26	Correct	60 ms	416 KB	Output is correct
27	Correct	8 ms	344 KB	Output is correct
28	Correct	7 ms	440 KB	Output is correct
29	Correct	15 ms	600 KB	Output is correct
30	Correct	8 ms	344 KB	Output is correct
31	Incorrect	185 ms	344 KB	Too many queries.
32	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	9 ms	344 KB	Output is correct
8	Correct	8 ms	344 KB	Output is correct
9	Incorrect	181 ms	412 KB	Too many queries.
10	Halted	0 ms	0 KB	-