Submission #627486

# Submission time Handle Problem Language Result Execution time Memory
627486 2022-08-12T15:34:00 Z I_love_Hoang_Yen Rarest Insects (IOI22_insects) C++17
45.45 / 100
245 ms 604 KB
#include "insects.h"
#include "bits/stdc++.h"
#define SZ(s) ((int) s.size())
using namespace std;

/* 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;
}
// }}}
*/

int get_max_freq(int n) {
    for (int i = 0; i < n; ++i) {
        move_inside(i);
    }
    int res = press_button();
    for (int i = 0; i < n; ++i) {
        move_outside(i);
    }
    return res;
}

int cnt_unique(int n) {
    int res = n;
    std::set<int> ids;
    for (int i = 0; i < n; ++i) {
        move_inside(i);
        ids.insert(i);
        if (press_button() == 2) {
            --res;
            move_outside(i);
            ids.erase(i);
        }
    }

    for (int id : ids) move_outside(id);
    return res;
}

int min_cardinality(int n) {
    int l = 2, r = get_max_freq(n), res = 1;
    int unique_vals = cnt_unique(n);

    while (l <= r) {
        int mid = (l + r) / 2;

        std::set<int> ids;
        for (int i = 0; i < n; ++i) {
            move_inside(i);
            ids.insert(i);
            if (press_button() > mid) {
                move_outside(i);
                ids.erase(i);
            }
        }

        int total = SZ(ids);
        for (int id : ids) move_outside(id);

        if (total >= unique_vals * mid) {
            // all values have at least frequency = mid
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    return res;
}
# 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 23 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 11 ms 300 KB Output is correct
9 Correct 5 ms 252 KB Output is correct
10 Correct 24 ms 208 KB Output is correct
11 Correct 9 ms 356 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 11 ms 296 KB Output is correct
14 Correct 16 ms 296 KB Output is correct
15 Correct 10 ms 304 KB Output is correct
16 Correct 14 ms 208 KB Output is correct
17 Correct 10 ms 296 KB Output is correct
18 Correct 13 ms 296 KB Output is correct
19 Correct 15 ms 424 KB Output is correct
20 Correct 11 ms 300 KB Output is correct
21 Correct 8 ms 296 KB Output is correct
22 Correct 7 ms 208 KB Output is correct
# 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 23 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 11 ms 300 KB Output is correct
9 Correct 5 ms 252 KB Output is correct
10 Correct 24 ms 208 KB Output is correct
11 Correct 9 ms 356 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 11 ms 296 KB Output is correct
14 Correct 16 ms 296 KB Output is correct
15 Correct 10 ms 304 KB Output is correct
16 Correct 14 ms 208 KB Output is correct
17 Correct 10 ms 296 KB Output is correct
18 Correct 13 ms 296 KB Output is correct
19 Correct 15 ms 424 KB Output is correct
20 Correct 11 ms 300 KB Output is correct
21 Correct 8 ms 296 KB Output is correct
22 Correct 7 ms 208 KB Output is correct
23 Correct 117 ms 304 KB Output is correct
24 Correct 11 ms 332 KB Output is correct
25 Correct 77 ms 312 KB Output is correct
26 Correct 68 ms 308 KB Output is correct
27 Correct 105 ms 236 KB Output is correct
28 Correct 55 ms 340 KB Output is correct
29 Correct 89 ms 300 KB Output is correct
30 Correct 57 ms 280 KB Output is correct
31 Correct 84 ms 436 KB Output is correct
32 Correct 43 ms 328 KB Output is correct
33 Correct 43 ms 400 KB Output is correct
34 Correct 83 ms 292 KB Output is correct
35 Correct 64 ms 324 KB Output is correct
36 Correct 35 ms 288 KB Output is correct
37 Correct 58 ms 344 KB Output is correct
38 Correct 59 ms 296 KB Output is correct
39 Correct 19 ms 304 KB Output is correct
40 Correct 14 ms 324 KB Output is correct
41 Correct 25 ms 304 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Partially correct 1 ms 208 KB Output is partially correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Partially correct 224 ms 376 KB Output is partially correct
8 Correct 10 ms 364 KB Output is correct
9 Partially correct 66 ms 380 KB Output is partially correct
10 Partially correct 126 ms 348 KB Output is partially correct
11 Partially correct 181 ms 292 KB Output is partially correct
12 Partially correct 245 ms 356 KB Output is partially correct
13 Partially correct 140 ms 296 KB Output is partially correct
14 Partially correct 127 ms 304 KB Output is partially correct
15 Partially correct 185 ms 356 KB Output is partially correct
16 Partially correct 216 ms 488 KB Output is partially correct
17 Partially correct 174 ms 372 KB Output is partially correct
18 Partially correct 162 ms 448 KB Output is partially correct
19 Partially correct 99 ms 368 KB Output is partially correct
20 Partially correct 155 ms 456 KB Output is partially correct
21 Partially correct 128 ms 340 KB Output is partially correct
22 Partially correct 73 ms 400 KB Output is partially correct
23 Partially correct 103 ms 312 KB Output is partially correct
24 Partially correct 88 ms 304 KB Output is partially correct
25 Partially correct 86 ms 368 KB Output is partially correct
26 Partially correct 45 ms 332 KB Output is partially correct
27 Partially correct 102 ms 352 KB Output is partially correct
28 Partially correct 139 ms 356 KB Output is partially correct
29 Partially correct 69 ms 384 KB Output is partially correct
30 Partially correct 82 ms 484 KB Output is partially correct
31 Partially correct 109 ms 432 KB Output is partially correct
32 Partially correct 94 ms 336 KB Output is partially correct
33 Partially correct 68 ms 336 KB Output is partially correct
34 Partially correct 115 ms 292 KB Output is partially correct
35 Partially correct 123 ms 368 KB Output is partially correct
36 Partially correct 114 ms 296 KB Output is partially correct
37 Partially correct 96 ms 348 KB Output is partially correct
38 Partially correct 79 ms 404 KB Output is partially correct
39 Partially correct 112 ms 332 KB Output is partially correct
40 Partially correct 52 ms 368 KB Output is partially correct
41 Partially correct 177 ms 376 KB Output is partially correct
42 Partially correct 122 ms 372 KB Output is partially correct
43 Partially correct 54 ms 300 KB Output is partially correct
44 Partially correct 201 ms 284 KB Output is partially correct
45 Partially correct 174 ms 584 KB Output is partially correct
46 Partially correct 161 ms 348 KB Output is partially correct
47 Partially correct 136 ms 356 KB Output is partially correct
48 Partially correct 203 ms 604 KB Output is partially correct