답안 #627507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627507 2022-08-12T15:57:41 Z I_love_Hoang_Yen 드문 곤충 (IOI22_insects) C++17
70.03 / 100
128 ms 552 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;
}
// }}}
*/

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;

    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);
    DEBUG(insides);

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

        assert(mid != freq);
        if (mid > freq) {
            for (int i = 0; i < n; ++i) {
                if (!insides.count(i)) {
                    add(i);
                    if (press_button() > mid) {
                        remove(i);
                    }
                }
            }
        } else {
            auto ids = insides;
            for (int id : ids) remove(id);

            for (int i : ids) {
                add(i);
                if (press_button() > mid) {
                    remove(i);
                }
            }
        }
        freq = mid;
        int total = SZ(insides);

        if (total >= unique_vals * mid) {
            // all values have at least frequency = mid
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 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 8 ms 304 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 9 ms 300 KB Output is correct
9 Correct 9 ms 300 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 10 ms 304 KB Output is correct
12 Correct 12 ms 296 KB Output is correct
13 Correct 9 ms 300 KB Output is correct
14 Correct 10 ms 424 KB Output is correct
15 Correct 11 ms 288 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 10 ms 336 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 5 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 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 8 ms 304 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 9 ms 300 KB Output is correct
9 Correct 9 ms 300 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 10 ms 304 KB Output is correct
12 Correct 12 ms 296 KB Output is correct
13 Correct 9 ms 300 KB Output is correct
14 Correct 10 ms 424 KB Output is correct
15 Correct 11 ms 288 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 10 ms 336 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 5 ms 208 KB Output is correct
23 Correct 38 ms 324 KB Output is correct
24 Correct 5 ms 308 KB Output is correct
25 Correct 30 ms 292 KB Output is correct
26 Correct 26 ms 320 KB Output is correct
27 Correct 36 ms 304 KB Output is correct
28 Correct 39 ms 312 KB Output is correct
29 Correct 42 ms 280 KB Output is correct
30 Correct 19 ms 304 KB Output is correct
31 Correct 51 ms 324 KB Output is correct
32 Correct 62 ms 324 KB Output is correct
33 Correct 33 ms 364 KB Output is correct
34 Correct 63 ms 320 KB Output is correct
35 Correct 24 ms 320 KB Output is correct
36 Correct 44 ms 284 KB Output is correct
37 Correct 51 ms 300 KB Output is correct
38 Correct 19 ms 316 KB Output is correct
39 Correct 44 ms 288 KB Output is correct
40 Correct 22 ms 308 KB Output is correct
41 Correct 29 ms 320 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Partially correct 1 ms 208 KB Output is partially correct
6 Correct 1 ms 208 KB Output is correct
7 Partially correct 64 ms 304 KB Output is partially correct
8 Correct 22 ms 340 KB Output is correct
9 Partially correct 60 ms 428 KB Output is partially correct
10 Partially correct 76 ms 420 KB Output is partially correct
11 Partially correct 62 ms 304 KB Output is partially correct
12 Partially correct 126 ms 448 KB Output is partially correct
13 Partially correct 71 ms 280 KB Output is partially correct
14 Partially correct 51 ms 284 KB Output is partially correct
15 Partially correct 77 ms 540 KB Output is partially correct
16 Partially correct 75 ms 476 KB Output is partially correct
17 Partially correct 90 ms 460 KB Output is partially correct
18 Partially correct 44 ms 424 KB Output is partially correct
19 Partially correct 76 ms 472 KB Output is partially correct
20 Partially correct 81 ms 452 KB Output is partially correct
21 Partially correct 75 ms 408 KB Output is partially correct
22 Partially correct 87 ms 328 KB Output is partially correct
23 Partially correct 73 ms 432 KB Output is partially correct
24 Partially correct 57 ms 428 KB Output is partially correct
25 Partially correct 56 ms 464 KB Output is partially correct
26 Partially correct 26 ms 440 KB Output is partially correct
27 Partially correct 46 ms 344 KB Output is partially correct
28 Partially correct 45 ms 452 KB Output is partially correct
29 Partially correct 48 ms 536 KB Output is partially correct
30 Partially correct 84 ms 444 KB Output is partially correct
31 Partially correct 70 ms 332 KB Output is partially correct
32 Partially correct 97 ms 412 KB Output is partially correct
33 Partially correct 63 ms 292 KB Output is partially correct
34 Partially correct 66 ms 304 KB Output is partially correct
35 Partially correct 60 ms 348 KB Output is partially correct
36 Partially correct 105 ms 284 KB Output is partially correct
37 Partially correct 42 ms 424 KB Output is partially correct
38 Partially correct 76 ms 424 KB Output is partially correct
39 Partially correct 47 ms 300 KB Output is partially correct
40 Partially correct 69 ms 360 KB Output is partially correct
41 Partially correct 28 ms 304 KB Output is partially correct
42 Partially correct 62 ms 304 KB Output is partially correct
43 Partially correct 20 ms 304 KB Output is partially correct
44 Partially correct 41 ms 416 KB Output is partially correct
45 Partially correct 71 ms 300 KB Output is partially correct
46 Partially correct 65 ms 416 KB Output is partially correct
47 Partially correct 89 ms 424 KB Output is partially correct
48 Partially correct 128 ms 552 KB Output is partially correct