oj.uz

Submission #627650

# Submission time Handle Problem Language Result Execution time Memory
627650 2022-08-12T18:03:37 Z I_love_Hoang_Yen Rarest Insects (IOI22_insects) C++17
50.03 / 100
 207 ms 388 KB 
#include "insects.h"
#include "bits/stdc++.h"
#define SZ(s) ((int) s.size())
using namespace std;

#ifndef RR
#define DEBUG(X)
#endif

/* sub1
// Sub 1 {{{
int min_cardinality(int n) {
    std::vector<int> v_ids(n);
    std::iota(v_ids.begin(), v_ids.end(), 0);

    std::set<int> ids(v_ids.begin(), v_ids.end());
    int freq = 0, last_cnt = 0;

    while (true) {
        ++freq;
        std::set<int> new_ids;

        for (int id : ids) {
            move_inside(id);
            if (press_button() > freq) {
                move_outside(id);
                new_ids.insert(id);
            }
        }

        int unique_values = SZ(ids) - SZ(new_ids);
        if (unique_values < last_cnt) {
            return freq - 1;
        }
        last_cnt = unique_values;

        if (unique_values > SZ(new_ids)) {
            return freq;
        }

        ids = std::move(new_ids);
    }

    return 0;
}
// }}}
*/

// seeds = set containing unique indices
int solve_small(int n, const std::set<int>& seeds) {
    std::set<int> used;
    int res = n;

    int n_unique = SZ(seeds);
    for (int turn = 0; turn + 1 < n_unique; ++turn) {
        std::set<int> cur;

        for (int i = 0; i < n; ++i) {
            if (!seeds.count(i) && !used.count(i)) {
                cur.insert(i);
                move_inside(i);

                if (press_button() != SZ(cur) + 1) {
                    move_outside(i);
                    cur.erase(i);
                }
            }
        }

        used.insert(cur.begin(), cur.end());
        res = std::min(res, SZ(cur) + 1);

        for (int i : cur) move_outside(i);
    }

    int remaining = n - SZ(used) - SZ(seeds) + 1;
    res = std::min(res, remaining);

    return res;
}

int min_cardinality(int n) {
    std::set<int> insides;
    int freq = 1;

    auto add = [&] (int i) {
        insides.insert(i);
        move_inside(i);
    };
    auto remove = [&] (int i) {
        insides.erase(i);
        move_outside(i);
    };

    for (int i = 0; i < n; ++i) {
        add(i);
        if (press_button() > 1) {
            remove(i);
        }
    }
    int unique_vals = SZ(insides);
    DEBUG(unique_vals);

    int l = 2, r = n / unique_vals, res = 1;
    while (l <= r) {
        int mid = l + (r - l + 1) / 2;

        assert(mid > freq);
        std::set<int> cur;
        for (int i = 0; i < n; ++i) {
            if (!insides.count(i)) {
                cur.insert(i);
                add(i);
                if (press_button() > mid) {
                    remove(i);
                    cur.erase(i);
                }
            }
        }
        int total = SZ(insides);

        if (total >= unique_vals * mid) {
            freq = mid;

            // all values have at least frequency = mid
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;

            for (int i : cur) remove(i);
        }
    }
    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 0 ms 244 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 3 ms 300 KB Output is correct
7 Correct 2 ms 300 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 18 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 12 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 6 ms 296 KB Output is correct
15 Correct 6 ms 300 KB Output is correct
16 Correct 6 ms 336 KB Output is correct
17 Correct 8 ms 280 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 2 ms 292 KB Output is correct
22 Correct 2 ms 208 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 0 ms 244 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 3 ms 300 KB Output is correct
7 Correct 2 ms 300 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 18 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 12 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 6 ms 296 KB Output is correct
15 Correct 6 ms 300 KB Output is correct
16 Correct 6 ms 336 KB Output is correct
17 Correct 8 ms 280 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 2 ms 292 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 23 ms 292 KB Output is correct
24 Correct 10 ms 324 KB Output is correct
25 Correct 32 ms 280 KB Output is correct
26 Correct 39 ms 328 KB Output is correct
27 Correct 64 ms 208 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 90 ms 292 KB Output is correct
30 Correct 57 ms 208 KB Output is correct
31 Correct 35 ms 208 KB Output is correct
32 Correct 34 ms 208 KB Output is correct
33 Correct 30 ms 284 KB Output is correct
34 Correct 24 ms 296 KB Output is correct
35 Correct 27 ms 300 KB Output is correct
36 Correct 35 ms 300 KB Output is correct
37 Correct 17 ms 208 KB Output is correct
38 Correct 29 ms 300 KB Output is correct
39 Correct 21 ms 304 KB Output is correct
40 Correct 12 ms 308 KB Output is correct
41 Correct 11 ms 312 KB Output is correct

Subtask #3
25.03 / 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 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 56 ms 340 KB Output is correct
8 Correct 24 ms 316 KB Output is correct
9 Correct 50 ms 296 KB Output is correct
10 Partially correct 79 ms 300 KB Output is partially correct
11 Partially correct 155 ms 304 KB Output is partially correct
12 Correct 24 ms 312 KB Output is correct
13 Partially correct 197 ms 288 KB Output is partially correct
14 Partially correct 123 ms 292 KB Output is partially correct
15 Partially correct 64 ms 288 KB Output is partially correct
16 Partially correct 48 ms 292 KB Output is partially correct
17 Partially correct 33 ms 288 KB Output is partially correct
18 Partially correct 44 ms 328 KB Output is partially correct
19 Partially correct 60 ms 276 KB Output is partially correct
20 Partially correct 61 ms 376 KB Output is partially correct
21 Partially correct 114 ms 296 KB Output is partially correct
22 Partially correct 39 ms 380 KB Output is partially correct
23 Partially correct 81 ms 380 KB Output is partially correct
24 Correct 55 ms 316 KB Output is correct
25 Correct 20 ms 316 KB Output is correct
26 Correct 20 ms 312 KB Output is correct
27 Correct 55 ms 296 KB Output is correct
28 Correct 77 ms 328 KB Output is correct
29 Correct 64 ms 328 KB Output is correct
30 Correct 39 ms 376 KB Output is correct
31 Partially correct 73 ms 380 KB Output is partially correct
32 Partially correct 96 ms 372 KB Output is partially correct
33 Partially correct 116 ms 296 KB Output is partially correct
34 Partially correct 124 ms 388 KB Output is partially correct
35 Correct 43 ms 328 KB Output is correct
36 Correct 47 ms 328 KB Output is correct
37 Partially correct 83 ms 372 KB Output is partially correct
38 Partially correct 74 ms 328 KB Output is partially correct
39 Correct 58 ms 284 KB Output is correct
40 Correct 50 ms 284 KB Output is correct
41 Correct 50 ms 280 KB Output is correct
42 Correct 58 ms 292 KB Output is correct
43 Partially correct 36 ms 208 KB Output is partially correct
44 Partially correct 207 ms 292 KB Output is partially correct
45 Correct 53 ms 376 KB Output is correct
46 Correct 29 ms 292 KB Output is correct
47 Correct 23 ms 340 KB Output is correct
48 Correct 20 ms 336 KB Output is correct