Submission #627613

# Submission time Handle Problem Language Result Execution time Memory
627613 2022-08-12T17:38:45 Z Tigerpants Rarest Insects (IOI22_insects) C++17
99.89 / 100
77 ms 288 KB
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <random>

using namespace std;

typedef vector<int> vi;
typedef set<int> si;
typedef vector<vi> vvi;
typedef vector<si> vsi;
typedef vector<bool> vb;

void move_inside(int i);
void move_outside(int i);
int press_button();

int min_cardinality(int N) {
    vi x(N);
    for (int i = 0; i < N; i++) {
        x[i] = i;
    }
    
    auto rng = default_random_engine {};
    shuffle(x.begin(), x.end(), rng);

    vb roots(N, false);
    vb inside(N, false);
    vb permanent(N, false);

    int no_roots = 1;
    roots[0] = true;
    move_inside(x[0]);
    inside[0] = true;
    permanent[0] = true;

    for (int i = 1; i < N; i++) {
        move_inside(x[i]);
        inside[i] = true;
        if (press_button() == 2) {
            move_outside(x[i]);
            inside[i] = false;
        } else {
            roots[i] = true;
            permanent[i] = true;
            no_roots++;
        }
    }

    vb active(N, true); // remove those which are too big
    
    if (no_roots == 1) {
        return N;
    }

    int no_inside = no_roots;
    
    int high = (N / no_roots) + 1;
    int low = 1;
    while (low + 1 < high) {
        int middle = (low + high) / 2;
        for (int i = 0; i < N; i++) {
            if ((!inside[i]) && (active[i])) {
                move_inside(x[i]);
                inside[i] = true;
                no_inside++;
                if (press_button() > middle) {
                    move_outside(x[i]);
                    inside[i] = false;
                    no_inside--;
                }
            }
        }
        if (no_inside == middle * no_roots) {
            low = middle;
            // don't remove them. make them permanent
            for (int i = 0; i < N; i++) {
                if (inside[i]) {
                    permanent[i] = true;
                }
            }
        } else {
            high = middle;
            // deactivate all higher ones
            // remove all non-permanent ones
            for (int i = 0; i < N; i++) {
                if (!inside[i]) {
                    active[i] = false;
                } else if (!permanent[i]) {
                    move_outside(x[i]);
                    no_inside--;
                    inside[i] = false;
                }
            }
        }
    }

    return low;
}
# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 7 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 5 ms 208 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 0 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 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 7 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 5 ms 208 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 9 ms 208 KB Output is correct
24 Correct 12 ms 208 KB Output is correct
25 Correct 29 ms 208 KB Output is correct
26 Correct 36 ms 208 KB Output is correct
27 Correct 27 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 22 ms 208 KB Output is correct
30 Correct 22 ms 208 KB Output is correct
31 Correct 24 ms 208 KB Output is correct
32 Correct 29 ms 208 KB Output is correct
33 Correct 23 ms 208 KB Output is correct
34 Correct 27 ms 208 KB Output is correct
35 Correct 27 ms 208 KB Output is correct
36 Correct 30 ms 208 KB Output is correct
37 Correct 29 ms 208 KB Output is correct
38 Correct 25 ms 216 KB Output is correct
39 Correct 22 ms 208 KB Output is correct
40 Correct 13 ms 208 KB Output is correct
41 Correct 10 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 20 ms 208 KB Output is correct
8 Correct 21 ms 208 KB Output is correct
9 Correct 41 ms 208 KB Output is correct
10 Correct 51 ms 208 KB Output is correct
11 Correct 35 ms 284 KB Output is correct
12 Correct 23 ms 208 KB Output is correct
13 Correct 45 ms 208 KB Output is correct
14 Correct 24 ms 208 KB Output is correct
15 Correct 45 ms 208 KB Output is correct
16 Correct 62 ms 208 KB Output is correct
17 Correct 60 ms 208 KB Output is correct
18 Correct 46 ms 208 KB Output is correct
19 Partially correct 25 ms 208 KB Output is partially correct
20 Correct 59 ms 208 KB Output is correct
21 Correct 58 ms 284 KB Output is correct
22 Correct 73 ms 288 KB Output is correct
23 Correct 49 ms 208 KB Output is correct
24 Correct 37 ms 208 KB Output is correct
25 Correct 26 ms 208 KB Output is correct
26 Correct 17 ms 208 KB Output is correct
27 Correct 77 ms 208 KB Output is correct
28 Correct 47 ms 208 KB Output is correct
29 Partially correct 61 ms 208 KB Output is partially correct
30 Partially correct 51 ms 208 KB Output is partially correct
31 Correct 51 ms 208 KB Output is correct
32 Correct 55 ms 208 KB Output is correct
33 Correct 55 ms 208 KB Output is correct
34 Correct 31 ms 284 KB Output is correct
35 Partially correct 41 ms 208 KB Output is partially correct
36 Partially correct 28 ms 208 KB Output is partially correct
37 Correct 48 ms 208 KB Output is correct
38 Correct 59 ms 208 KB Output is correct
39 Correct 43 ms 208 KB Output is correct
40 Correct 51 ms 208 KB Output is correct
41 Partially correct 61 ms 208 KB Output is partially correct
42 Partially correct 59 ms 208 KB Output is partially correct
43 Correct 10 ms 208 KB Output is correct
44 Correct 37 ms 208 KB Output is correct
45 Correct 28 ms 208 KB Output is correct
46 Correct 19 ms 208 KB Output is correct
47 Correct 28 ms 208 KB Output is correct
48 Correct 27 ms 208 KB Output is correct