Submission #837436

# Submission time Handle Problem Language Result Execution time Memory
837436 2023-08-25T10:50:11 Z tengiz05 Rarest Insects (IOI22_insects) C++17
57.29 / 100
140 ms 416 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int n) {
    int cnt = n;
    move_inside(0);
    vector<int> a{0};
    for (int i = 1; i < n; i++) {
        move_inside(i);
        if (press_button() == 2) {
            cnt--;
            move_outside(i);
        } else {
            a.push_back(i);
        }
    }
    
    if (cnt <= 7) {
        for (int x : a) move_outside(x);
        int ans = n;
        for (int x : a) {
            move_inside(x);
            int c = 1;
            for (int i = x + 1; i < n; i++) {
                if (binary_search(a.begin(), a.end(), i)) continue;
                move_inside(i);
                if (press_button() > 1) {
                    c++;
                }
                move_outside(i);
            }
            move_outside(x);
            ans = min(ans, c);
        }
        return ans;
    }
    
    auto check = [&](int m) {
        vector<int> b;
        int bad = 0;
        for (int i = 0; i < n; i++) {
            if (!binary_search(a.begin(), a.end(), i)) {
                move_inside(i);
                if (press_button() <= m) {
                    b.push_back(i);
                } else {
                    move_outside(i);
                    bad++;
                }
            }
        }
        for (int x : b) {
            move_outside(x);
        }
        if (n - bad == m * cnt) {
            return true;
        } else {
            return false;
        }
    };
    int lo = 2, hi = n / cnt + 1;
    while (lo < hi) {
        int m = (lo + hi) / 2;
        if (check(m)) {
            lo = m + 1;
        } else {
            hi = m;
        }
    }
    return max(1, lo - 1);
}
# 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 Correct 1 ms 260 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 296 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 4 ms 260 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 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 Correct 1 ms 260 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 296 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 4 ms 260 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 6 ms 300 KB Output is correct
25 Correct 25 ms 336 KB Output is correct
26 Correct 49 ms 284 KB Output is correct
27 Correct 21 ms 208 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 40 ms 208 KB Output is correct
30 Correct 41 ms 280 KB Output is correct
31 Correct 43 ms 208 KB Output is correct
32 Correct 56 ms 292 KB Output is correct
33 Correct 38 ms 400 KB Output is correct
34 Correct 45 ms 292 KB Output is correct
35 Correct 43 ms 208 KB Output is correct
36 Correct 38 ms 292 KB Output is correct
37 Correct 37 ms 288 KB Output is correct
38 Correct 32 ms 288 KB Output is correct
39 Correct 29 ms 208 KB Output is correct
40 Correct 14 ms 296 KB Output is correct
41 Correct 9 ms 208 KB Output is correct
# 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 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 23 ms 288 KB Output is correct
8 Correct 18 ms 208 KB Output is correct
9 Partially correct 44 ms 292 KB Output is partially correct
10 Partially correct 93 ms 288 KB Output is partially correct
11 Correct 52 ms 208 KB Output is correct
12 Correct 25 ms 208 KB Output is correct
13 Partially correct 58 ms 208 KB Output is partially correct
14 Partially correct 82 ms 292 KB Output is partially correct
15 Partially correct 64 ms 208 KB Output is partially correct
16 Partially correct 127 ms 348 KB Output is partially correct
17 Partially correct 131 ms 292 KB Output is partially correct
18 Partially correct 118 ms 372 KB Output is partially correct
19 Partially correct 103 ms 296 KB Output is partially correct
20 Partially correct 108 ms 416 KB Output is partially correct
21 Partially correct 93 ms 296 KB Output is partially correct
22 Partially correct 57 ms 288 KB Output is partially correct
23 Partially correct 44 ms 328 KB Output is partially correct
24 Correct 23 ms 284 KB Output is correct
25 Correct 17 ms 288 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Partially correct 70 ms 292 KB Output is partially correct
28 Partially correct 77 ms 208 KB Output is partially correct
29 Partially correct 140 ms 304 KB Output is partially correct
30 Partially correct 96 ms 416 KB Output is partially correct
31 Partially correct 76 ms 288 KB Output is partially correct
32 Partially correct 81 ms 256 KB Output is partially correct
33 Partially correct 60 ms 284 KB Output is partially correct
34 Partially correct 79 ms 208 KB Output is partially correct
35 Partially correct 64 ms 208 KB Output is partially correct
36 Partially correct 92 ms 292 KB Output is partially correct
37 Partially correct 98 ms 296 KB Output is partially correct
38 Partially correct 79 ms 328 KB Output is partially correct
39 Partially correct 78 ms 328 KB Output is partially correct
40 Partially correct 55 ms 292 KB Output is partially correct
41 Partially correct 89 ms 284 KB Output is partially correct
42 Partially correct 77 ms 288 KB Output is partially correct
43 Partially correct 24 ms 208 KB Output is partially correct
44 Partially correct 45 ms 208 KB Output is partially correct
45 Correct 46 ms 332 KB Output is correct
46 Correct 20 ms 328 KB Output is correct
47 Correct 25 ms 208 KB Output is correct
48 Correct 24 ms 208 KB Output is correct