oj.uz

Submission #628880

# Submission time Handle Problem Language Result Execution time Memory
628880 2022-08-13T18:52:15 Z I_love_Hoang_Yen Rarest Insects (IOI22_insects) C++17
99.89 / 100
 79 ms 1212 KB 
#include "insects.h"
#include "bits/stdc++.h"

#define SZ(s) ((int) s.size())
using namespace std;

#ifndef RR
#define DEBUG(X)
#endif

mt19937_64 rng(58);
int min_cardinality(int n) {
    std::set<int> insides;  // set of insects inside machine

    std::vector<int> order(n);
    std::iota(order.begin(), order.end(), 0);
    shuffle(order.begin(), order.end(), rng);

    // lambda functions {{{
    // lambda function to add one insect to machine
    auto add = [&] (int i) { move_inside(order[i]); insides.insert(i); };
    // lambda function to remove one insect from machine
    auto remove = [&] (int i) { move_outside(order[i]); insides.erase(i); };
    // }}}

    // machine_states(f) = set of insects inside machine after we
    //                     binary search with value f
    std::map<int, std::set<int>> machine_states;

    // Step 1: Find set containing unique insects {{{
    for (int i = 0; i < n; ++i) {
        add(i);
        if (press_button() > 1) {  // this species appeared before
            remove(i);
        }
    }
    int unique_vals = SZ(insides);
    DEBUG(unique_vals);
    // }}}

    std::set<int> candidates;
    for (int i = 0; i < n; ++i) if (!insides.count(i)) candidates.insert(i);

    // Step 2: Binary search for min f
    int l = 2, r = n / unique_vals, res = 1;
    while (l <= r) {
        int mid = (l + r) / 2;

        std::set<int> just_added, just_removed;
        for (int i : candidates) if (!insides.count(i)) {
            add(i);
            if (press_button() > mid) {
                remove(i);
                just_removed.insert(i);
            } else {
                just_added.insert(i);
            }
        }
        int total = SZ(insides);
        machine_states[mid] = insides;

        if (total >= unique_vals * mid) {
            res = mid;
            l = mid + 1;
            candidates = just_removed;
        } else {
            r = mid - 1;
            for (int i : just_added) {
                remove(i);
            }
            candidates = just_added;
        }
    }
    return res;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 5 ms 336 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 3 ms 320 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 304 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 4 ms 300 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 3 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 5 ms 336 KB Output is correct
22 Correct 3 ms 312 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 5 ms 336 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 3 ms 320 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 304 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 4 ms 300 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 3 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 5 ms 336 KB Output is correct
22 Correct 3 ms 312 KB Output is correct
23 Correct 33 ms 696 KB Output is correct
24 Correct 10 ms 336 KB Output is correct
25 Correct 32 ms 428 KB Output is correct
26 Correct 30 ms 424 KB Output is correct
27 Correct 26 ms 328 KB Output is correct
28 Correct 12 ms 312 KB Output is correct
29 Correct 23 ms 300 KB Output is correct
30 Correct 33 ms 412 KB Output is correct
31 Correct 35 ms 620 KB Output is correct
32 Correct 35 ms 520 KB Output is correct
33 Correct 42 ms 532 KB Output is correct
34 Correct 37 ms 556 KB Output is correct
35 Correct 23 ms 484 KB Output is correct
36 Correct 27 ms 480 KB Output is correct
37 Correct 29 ms 400 KB Output is correct
38 Correct 24 ms 292 KB Output is correct
39 Correct 16 ms 328 KB Output is correct
40 Correct 12 ms 372 KB Output is correct
41 Correct 9 ms 312 KB Output is correct

Subtask #3
74.89 / 75.0

# 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 1 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 46 ms 1212 KB Output is correct
8 Correct 18 ms 488 KB Output is correct
9 Correct 68 ms 832 KB Output is correct
10 Correct 67 ms 520 KB Output is correct
11 Correct 49 ms 504 KB Output is correct
12 Correct 26 ms 436 KB Output is correct
13 Correct 56 ms 436 KB Output is correct
14 Correct 32 ms 548 KB Output is correct
15 Correct 58 ms 1012 KB Output is correct
16 Correct 57 ms 976 KB Output is correct
17 Correct 51 ms 936 KB Output is correct
18 Correct 36 ms 804 KB Output is correct
19 Partially correct 79 ms 880 KB Output is partially correct
20 Correct 56 ms 780 KB Output is correct
21 Correct 69 ms 568 KB Output is correct
22 Correct 62 ms 568 KB Output is correct
23 Correct 28 ms 436 KB Output is correct
24 Correct 45 ms 540 KB Output is correct
25 Correct 30 ms 464 KB Output is correct
26 Correct 22 ms 360 KB Output is correct
27 Correct 68 ms 740 KB Output is correct
28 Correct 49 ms 692 KB Output is correct
29 Partially correct 60 ms 824 KB Output is partially correct
30 Partially correct 60 ms 824 KB Output is partially correct
31 Correct 35 ms 568 KB Output is correct
32 Correct 63 ms 620 KB Output is correct
33 Correct 75 ms 588 KB Output is correct
34 Correct 64 ms 508 KB Output is correct
35 Partially correct 55 ms 744 KB Output is partially correct
36 Partially correct 62 ms 812 KB Output is partially correct
37 Correct 44 ms 568 KB Output is correct
38 Correct 47 ms 564 KB Output is correct
39 Correct 51 ms 624 KB Output is correct
40 Correct 42 ms 676 KB Output is correct
41 Partially correct 64 ms 772 KB Output is partially correct
42 Partially correct 64 ms 804 KB Output is partially correct
43 Correct 12 ms 308 KB Output is correct
44 Correct 34 ms 404 KB Output is correct
45 Correct 60 ms 1152 KB Output is correct
46 Correct 23 ms 460 KB Output is correct
47 Correct 29 ms 444 KB Output is correct
48 Correct 25 ms 404 KB Output is correct