oj.uz

답안 #627520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627520 2022-08-12T16:13:00 Z I_love_Hoang_Yen 드문 곤충 (IOI22_insects) C++17
25 / 100
 259 ms 432 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 - l + 1) / 2 / unique_vals;

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 5 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 12 ms 300 KB Output is correct
9 Correct 17 ms 308 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 8 ms 296 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 13 ms 304 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 15 ms 208 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 5 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 12 ms 300 KB Output is correct
9 Correct 17 ms 308 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 8 ms 296 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 13 ms 304 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 15 ms 208 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 14 ms 416 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 119 ms 324 KB Output is correct
26 Correct 136 ms 292 KB Output is correct
27 Correct 19 ms 208 KB Output is correct
28 Correct 12 ms 336 KB Output is correct
29 Correct 27 ms 284 KB Output is correct
30 Correct 15 ms 304 KB Output is correct
31 Correct 86 ms 432 KB Output is correct
32 Correct 109 ms 316 KB Output is correct
33 Correct 121 ms 332 KB Output is correct
34 Correct 132 ms 296 KB Output is correct
35 Correct 140 ms 300 KB Output is correct
36 Correct 144 ms 280 KB Output is correct
37 Correct 88 ms 304 KB Output is correct
38 Correct 15 ms 336 KB Output is correct
39 Correct 9 ms 312 KB Output is correct
40 Correct 12 ms 428 KB Output is correct
41 Correct 12 ms 308 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 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 Partially correct 1 ms 208 KB Output is partially correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Partially correct 36 ms 412 KB Output is partially correct
8 Correct 16 ms 316 KB Output is correct
9 Incorrect 259 ms 336 KB Too many queries.
10 Halted 0 ms 0 KB -